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
Testing string superprimitivity in parallel
Information Processing Letters
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
How many squares can a string contain?
Journal of Combinatorial Theory Series A
The exact number of squares in Fibonacci words
Theoretical Computer Science
Quasiperiodicity: From detection to normal forms
Automatica (Journal of IFAC)
Of Periods, Quasiperiods, Repetitions and Covers
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Finding Maximal Quasiperiodicities in Strings
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
String pattern matching for a deluge survival kit
Handbook of massive data sets
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Algorithms on Strings
Quasiperiodic Sturmian words and morphisms
Theoretical Computer Science
Quasiperiodic and Lyndon episturmian words
Theoretical Computer Science
Computing regularities in strings: A survey
European Journal of Combinatorics
| Hi-index | 5.23 |
Improving a 1993 algorithm of Apostolico and Ehrenfeucht, independently Iliopoulos and Mouchard in 1999 and Brodal and Pedersen in 2000 provided O(nlog(n)) algorithms to determine all maximal quasiperiodicities of a word of length n. We show here the optimality of this bound providing an infinite family of words w containing O(|w|log|w|) maximal quasiperiodicities. We also show that this bound is not reached for the celebrated family of Fibonacci words.