Improved algorithms for finding consistent superstrings based on a new graph model

초록

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. © 2009 Springer-Verlag Berlin Heidelberg.