On maximal repetitions in words
A (fractional) repetition in a word w is a subword with the period of at most half of the subword length. We study maximal repetitions occurring in w, that is those for which any extended subword of w has a bigger period. The set of such repetitions represents in a compact way all repetitions in w.
We first study maximal repetitions in Fibonacci words — we count their exact number, and estimate the sum of their exponents. These quantities turn out to be linearly-bounded in the length of the word. We then prove that the maximal number of maximal repetitions in general words (on arbitrary alphabet) of length n is linearly-bounded in n, and we mention some applications and consequences of this result.
Unable to display preview. Download preview PDF.
- [CR94]M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.Google Scholar
- [FS95]A.S. Fraenkel and J. Simpson. How many squares must a binary sequence contain? Electronic Journal of Combinatorics, 2(R2):9pp, 1995. http://www.combinatorics.org/Journal/journalhome.html.Google Scholar
- [JP99]J. Justin and G. Pirillo. Fractional powers in Sturmian words. Technical Report LIAFA 99/01, Laboratoire d’Informatique Algorithmique: Fondements et Applications (LIAFA), 1999.Google Scholar
- [KK98]R. Kolpakov and G. Kucherov. Maximal repetitions in words or how to find all squares in linear time. Rapport Interne LORIA 98-R-227, Laboratoire Lorrain de Recherche en Informatique et ses Applications, 1998. available from URL: http://www.loria.fr/~kucherov/res_activ.html.
- [Kos94]S. R. Kosaraju. Computation of squares in string. In M. Crochemore and D. Gusfield, editors, Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, number 807 in Lecture Notes in Computer Science, pages 146–150. Springer Verlag, 1994.Google Scholar
- [Lot83]M. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and Its Applications. Addison Wesley, 1983.Google Scholar
- [ML85]M.G. Main and R.J. Lorentz. Linear time recognition of square free strings. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO Advanced Science Institutes, Series F, pages 272–278. Springer Verlag, 1985.Google Scholar
- [MRS95]F. Mignosi, A. Restivo, and S. Salemi. A periodicity theorem on words and applications. In Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 969 of Lecture Notes in Computer Science, pages 337–348. Springer Verlag, 1995.Google Scholar
- [Sèè85]P. Sèèbold. Propriètès combinatoires des mots infinis engendrès par certains morphismes. Rapport 85-16, LITP, Paris, 1985.Google Scholar
- [SG98a]J. Stoye and D. Gusfield. Simple and flexible detection of contiguous repeats using a suffix tree. In M. Farach-Colton, editor, Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, number 1448 in Lecture Notes in Computer Science, pages 140–152. Springer Verlag, 1998.CrossRefGoogle Scholar
- [SG98b]J. Stoye and D. Gusfield. Linear time algorithms for finding and representing all the tandem repeats in a string. Technical Report CSE-98-4, Computer Science Department, University of California, Davis, 1998.Google Scholar