STRINGOLOGY
2004
14 years 5 days ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
STRINGOLOGY
2004
14 years 5 days ago
2004
STRINGOLOGY
2004
14 years 5 days ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
STRINGOLOGY
2004
14 years 5 days ago
2004
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
STRINGOLOGY
2004
14 years 5 days ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
STRINGOLOGY
2008
14 years 7 days ago
2008
Abstract. We study the problem of finding local and global covers as well as seeds in conservative indeterminate strings. An indeterminate string is a sequence T = T[1]T[2] . . . T...
STRINGOLOGY
2008
14 years 7 days ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
STRINGOLOGY
2008
14 years 7 days ago
2008
STRINGOLOGY
2008
14 years 7 days ago
2008
In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
STRINGOLOGY
2008
14 years 7 days ago
2008