Abstract
A factor u of a word w is a cover of w if every position in w lies within some occurrence of u in w. A word w covered by u thus generalizes the idea of a repetition, that is, a word composed of exact concatenations of u. In this article we introduce a new notion of partial cover, which can be viewed as a relaxed variant of cover, that is, a factor covering at least a given number of positions in w. Our main result is an O(nlogn)-time algorithm for computing the shortest partial covers of a word of length n. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Kociumaka, T., Pissis, S. P., Radoszewski, J., Rytter, W., & Waleń, T. (2013). Fast algorithm for partial covers in words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7922 LNCS, pp. 177–188). https://doi.org/10.1007/978-3-642-38905-4_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
