Data compression: methods and theory
Data compression: methods and theory
Shortest consistent superstrings computable in polynomial time
Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
String Noninclusion Optimization Problems
SIAM Journal on Discrete Mathematics
A Space-Economical Suffix Tree Construction Algorithm
Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
Data compression via textual substitution
Journal of the ACM (JACM)
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Hi-index | 0.89 |
String inclusion and non-inclusion problems have been vigorously studied in such diverse fields as molecular biology, data compression, and computer security. Among the well-known string inclusion or non-inclusion notions, we are interested in the longest common nonsuperstring. Given a set of strings, the longest common nonsuperstring problem is finding the longest string that is not a superstring of any string in the given set. It is known that the longest common nonsuperstring problem is solvable in polynomial time. In this paper, we propose an efficient algorithm for the longest common nonsuperstring problem. The running time of our algorithm is linear with respect to the sum of the lengths of the strings in the given set, using generalized suffix trees.