On maximal repetitions in words

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1684, Issue , 1999, Pages 374-385

  Kolpakov, Roman ^a   Kucherov, Gregory ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b LORIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FIBONACCI WORD; MAXIMAL REPETITIONS; SUB WORDS;

COMPUTATION THEORY;

EID: 84956858781     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48321-7_31     Document Type: Conference Paper

References (24)

1. A. Apostolico and F.P. Preparata. Optimal off-line detection of repetitions in a string. Theoretical Computer Science, 22(3):297-315, 1983.
2. M. Crochemore and W. Rytter. Text algorithms. Oxford University Press, 1994.
3. M. Crochemore and W. Rytter. Squares, cubes, and time-space efficient string searching. Algorithmica, 13:405-425, 1995.
4. M. Crochemore. An optimal algorithm for computing the repetitions in a word. Information Processing Letters, 12:244-250, 1981.
5. M. Crochemore. Recherche lineaire d’un carre dans un mot. Comptes Rendus Acad. Sci. Paris Ser. I Math., 296:781-784, 1983.
6. J.D. Currie and R.O. Shelton. Cantor sets and Dejean’s conjecture. Journal of Automata, Languages and Combinatorics, 1(2):113-128, 1996.
7. F. Dejean. Sur un theoreme de Thue. J. Combinatorial Th. (A), 13:90-99, 1972.
8. A.S. Fraenkel and J. Simpson. How many squares must a binary se­quence contain? Electronic Journal of Combinatorics, 2(R2):9pp, 1995. http://www.combinatorics.org/Journal/journalhome.html.
9. A.S. Fraenkel and J. Simpson. How many squares can a string contain? J. Combinatorial Theory (Ser. A), 82:112-120, 1998.
10. A.S. Fraenkel and J. Simpson. The exact number of squares in Fibonacci words. Theoretical Computer Science, 218(1):83-94, 1999.
11. S. Iliopoulos, D. Moore, and W.F. Smyth. A characterization of the squa­res in a Fibonacci string. Theoretical Computer Science, 172:281-291, 1997.
12. J. Justin and G. Pirillo. Fractional powers in Sturmian words. Technical Re­port LIAFA 99/01, Laboratoire d’Informatique Algorithmique: Fondements et Applications (LIAFA), 1999.
13. 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.
14. S. R. Kosaraju. Computation of squares in string. In M. Crochemore and Gusfield, editors Proceedings of the 5th Annual Symposium on Combina­torial Pattern Matching, number 807 in Lecture Notes in Computer Science, pages 146-150. Springer Verlag, 1994.
15. M. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of Ma­thematics and Its Applications. Addison Wesley, 1983.
16. M. G. Main. Detecting leftmost maximal periodicities. Discrete Applied Mathematics, 25:145-153, 1989.
17. M.G. Main and R.J. Lorentz. An O(n log n) algorithm for finding all repe­titions in a string. Journal of Algorithms, 5(3):422-432, 1984.
18. 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.
19. F. Mignosi and G. Pirillo. Repetitions in the Fibonacci infinite word. RAIRO Theoretical Informatics and Applications, 26(3):199-204, 1992.
20. F. Mignosi, A. Restivo, and S. Salemi. A periodicity theorem on words and applications. In Proceedings of the 20th International Symposium on Mathe­matical Foundations of Computer Science (MFCS), volume 969 of Lecture Notes in Computer Science, pages 337-348. Springer Verlag, 1995.
21. P. Séébold. Propriétés combinatoires des mots infinis engendres par certains morphismes. Rapport 85-16, LITP, Paris, 1985.
22. 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.
23. 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.
24. A.O. Slisenko. Detection of periodicities and string matching in real time. Journal of Soviet Mathematics, 22:1316-1386, 1983.