Optimal superprimitivity testing for strings
Information Processing Letters
An on-line string superprimitivity test
Information Processing Letters
Efficient detection of quasiperiodicities in strings
Theoretical Computer Science
An optimal algorithm to compute all the covers of a string
Information Processing Letters
A correction to “An optimal algorithm to compute all the covers of a string”
Information Processing Letters
A work-time optimal algorithm for computing all string covers
Theoretical Computer Science
String regularities with don't cares
Nordic Journal of Computing - Special issue: Selected papers of the Prague Stringology conference (PSC'02), September 23-24, 2002
Algorithms on Strings
New complexity results for the k-covers problem
Information Sciences: an International Journal
Efficient seeds computation revisited
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
On the right-seed array of a string
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Computing regularities in strings: A survey
European Journal of Combinatorics
Hi-index | 5.23 |
A factor u of a string y is a cover of y if every letter of y lies within some occurrence of u in y; thus every cover u is also a border-both prefix and suffix-of y. If u is a cover of a superstring of y then u is a seed of y. Covers and seeds are two formalisations of quasiperiodicity, and there exist linear-time algorithms for computing all the covers and seeds of y. A string y covered by u thus generalises the idea of a repetition; that is, a string composed of exact concatenations of u. Even though a string is coverable somewhat more frequently than it is a repetition, still a string that can be covered by a single u is rare. As a result, seeking to find a more generally applicable and descriptive notion of cover, many articles were written on the computation of a minimum k-cover of y; that is, the minimum cardinality set of strings of length k that collectively cover y. Unfortunately, this computation turns out to be NP-hard. Therefore, in this article, we propose new, simple, easily-computed, and widely applicable notions of string covering that provide an intuitive and useful characterisation of a string: the enhanced cover; the enhanced left cover; and the enhanced left seed.