We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with the property that no two holes are within distance d. Our algorithm runs in O(nd) time and is used for the study of freeness of partial words. Furthermore, we construct an infinite word over a five-letter alphabet that is overlapfree even after the insertion of an arbitrary number of holes, answering affirmatively a conjecture from Blanchet-Sadri, Mercaş, and Scott. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Blanchet-Sadri, F., Mercaş, R., Rashin, A., & Willett, E. (2009). An answer to a conjecture on overlaps in partial words using periodicity algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5457, pp. 188–199). https://doi.org/10.1007/978-3-642-00982-2_16
Mendeley helps you to discover research relevant for your work.