Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903652 | European Journal of Combinatorics | 2018 | 19 Pages |
Abstract
This paper deals with two types of repetitions in strings: squares, which consist of two adjacent occurrences of substrings, and runs, which are periodic substrings that cannot be extended further to the left or right while maintaining the period. We show how to compute all the primitively-rooted squares in a given partial word, which is a sequence that may have undefined positions, called holes or wildcards, that match any letter of the alphabet over which the sequence is defined. We also describe an algorithm for computing all primitively-rooted runs in a given partial word and extend previous analyses on the number of runs to partial words.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
F. Blanchet-Sadri, J. Lazarow, J. Nikkel, J.D. Quigley, X. Zhang,