Data compression: methods and theory
Data compression: methods and theory
Approximating shortest superstrings with constraints
Theoretical Computer Science
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
Data compression via textual substitution
Journal of the ACM (JACM)
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Finding the longest common nonsuperstring in linear time
Information Processing Letters
Hi-index | 0.00 |
The problems that are related to string inclusion and non-inclusion have been vigorously studied in such diverse fields as data compression, molecular biology, and computer security. Given a finite set of negative strings 驴 and a finite set of positive strings 驴, a string 驴 is a consistent superstring if every positive string is a substring of 驴 and no negative string is a substring of 驴. The shortest (resp. longest) consistent superstring problem is finding a string 驴 that is the shortest (resp. longest) among all the consistent superstrings for the given sets of strings.In this paper, we first propose a new graph model based on the Aho-Corasick algorithm to represent the consistent superstrings for the given sets. Then, we propose improved algorithms for the problems of the shortest consistent superstring and the longest consistent superstring using the graph model.