Finding the longest common nonsuperstring in linear time
From MaRDI portal
Publication:989576
DOI10.1016/j.ipl.2009.06.010zbMath1202.68475OpenAlexW2017496585MaRDI QIDQ989576
Jeong Seop Sim, Joong Chae Na, Dong Kyue Kim
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.06.010
design of algorithmsgeneralized suffix treelongest common nonsuperstringstring non-inclusion problem
Related Items
Cites Work
- Shortest consistent superstrings computable in polynomial time
- On-line construction of suffix trees
- Data compression via textual substitution
- A Space-Economical Suffix Tree Construction Algorithm
- The Complexity of Some Problems on Subsequences and Supersequences
- String Noninclusion Optimization Problems
- Algorithms on Strings, Trees and Sequences
- Unnamed Item