Linear-time computation of local periods

Theoretical Computer Science

Volumn 326, Issue 1-3, 2004, Pages 229-240

  Duval, Jean Pierre ^a   Kolpakov, Roman ^b,d   Kucherov, Gregory ^c   Lecroq, Thierry ^a   Lefebvre, Arnaud ^a  

^a UNIVERSITÉ DE ROUEN   (France)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c LORIA   (France)

^d MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Algorithm; Complexity; Local period; Period; String matching; Word

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; FUNCTIONS; INFORMATION ANALYSIS; STRUCTURED PROGRAMMING; THEOREM PROVING;

KNUTH-MORRIS-PRATT STRING MATCHING METHODS; LOCAL PERIOD; PERIOD; STRING MATCHING; WORD;

COMBINATORIAL MATHEMATICS;

EID: 5144221373     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.06.024     Document Type: Article

References (31)

1. Y. Cesari, M. Vincent, Une caractérisation des mots périodiques, Comptes Rendus de l'Académie des Sciences Paris 286 (A) (1978) 1175-1177.
2. C. Choffrut, J. Karhumäki, Combinatorics of words, G. Rozenberg, A. Salomaa (Eds.), Handbook on Formal Languages, Vol. I, Springer, Berlin, Heidelberg, New York, 1997, pp. 329-438.
3. M. Crochemore, An optimal algorithm for computing the repetitions in a word, Inform. Process. Lett. 12 (5) (1981) 244-250.
4. M. Crochemore, Recherche linéaire d'un carré dans un mot, Comptes Rendus de l'Académie des Sciences Paris Série I Mathématiques 296 (1983) 781-784.
5. M. Crochemore, D. Perrin, Two-way string matching, J. ACM 38 (3) (1991) 651-675.
6. M. Crochemore, W. Rytter, Text Algorithms, Oxford University Press, Oxford, 1994.
7. M. Crochemore, W. Rytter, Squares, cubes, and time-space efficient string searching, Algorithmica 13 (5) (1995) 405-425.
8. A. Czumaj, L. Ga̧sieniec, On the complexity of determining the period of a string, in: R. Giancarlo, D. Sankoff (Eds.), Proc. 11th Annual Symp. on Combinatorial Pattern Matching, CPM, Montréal, Canada, Lecture Notes in Computer Science, Vol. 1848, Springer, Berlin, 2000, pp. 412-422.
9. J.-P. Duval, Périodes et Répétitions des Mots du Monoide Libre, Theor. Comput. Sci. 9 (1979) 17-26.
10. J.-P. Duval, Périodes locales et propagation de périodes dans un mot, Theor. Comput. Sci. 204(1-2) (1998) 87-98.
11. J.-P. Duval, F. Mignosi, A. Restivo, Recurrence and periodicity in infinite words from local periods, Theor. Comput. Sci. 262 (1) (2001) 269-284.
12. A.S. Fraenkel, J. Simpson, How many squares can a string contain?, J. Combin. Theory, Ser. A 82 (1998) 112-120.
13. Z. Galil, J. Seiferas, Time-space optimal string matching, J. Comput. System Sci. 26 (3) (1983) 280-294.
14. L.J. Guibas, A.M. Odlyzko, Periods in strings, J. Combin. Theory, Ser. A 30 (1981) 19-42.
15. D. Gusfield, Algorithms on Strings, trees, and sequences, Computer Science and Computational Biology, Cambridge University Press, Cambridge, 1997.
16. D. Gusfield, J. Stoye, Linear-time algorithms for finding and representing all tandem repeats in a string, J. Comput. Syst. Sci., in press.
17. T. Jiang, Z. Jiang, D. Breslauer, Rotation of periodic strings and short superstrings, in: N. Ziviani, R. BaezaYates, K. Guimarães (Eds.), Proc. Third SouthAmerican Workshop on String Processing, WSP, Recife, Brazil, Carleton University Press, 1996, pp. 115-125.
18. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (2) (1977) 323-350.
19. R. Kolpakov, G. Kucherov, Finding maximal repetitions in a word in linear time, in: Proc. 1999 Symp. on Foundations of Computer Science, FOCS, October 17-19 1999, New York, IEEE Computer Society, SilverSpring, MD, pp. 596-604.
20. R. Kolpakov, G. Kucherov, Finding repeats with fixed gap, in: Proc. Seventh Internat. Symp. on String Processing and Information Retrieval, SPIRE, September 2000, A Coruña, Spain, IEEE Computer Society, SilverSpring, MD, pp. 162-168.
21. R. Kolpakov, G. Kucherov, Finding approximate repetitions under hamming distance, in: F. Meyer auf der Heide (Ed.), Proc. Ninth European Symp. on Algorithms, ESA, Aarhus, Denmark, Lecture Notes in Computer Science,Vol. 2161, Springer, Berlin, August 2001, pp. 170-181.
22. S.R. Kosaraju, Computation of squares in string, M. Crochemore, D. Gusfield (Eds.), Proc. Fifth Annual Symp. on Combinatorial Pattern Matching, CPM, Asilomar, California, Lecture Notes in Computer Science, Vol. 807, Springer, Berlin, 1994, pp. 146-150.
23. M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics and Its Applications, Vol. 17, Addison Wesley, Reading, MA, 1983.
24. M. Lothaire, Algebraic Combinatorics on Words, Cambridge University Press, Cambridge, 2002.
25. M.G. Main, Detecting leftmost maximal periodicities, Discrete Appl. Math. 25 (1-2) (1989) 145-153.
26. M.G. Main, R.J. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, J. Algorithms 5 (3) (1984) 422-432.
27. F. Mignosi, A. Restivo, S. Salemi, A periodicity theorem on words and applications, in: J. Wiedermann, P. Hájek (Eds.), Proc. 20th Internat. Symp. on Mathematical Foundations of Computer Science, MFCS, Prague, Czech Republic, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 337-348.
28. J.H. Morris, Jr., V.R. Pratt, A linear pattern-matching algorithm, Report, University of California, Berkeley, Number 40, 1970.
29. E. Rivals, S. Rahmann, Combinatorics of periods in strings, in: J. van Leuween, P. Orejas, P.G. Spirakis (Eds.), Proc. 28th Internat. Colloq. on Automata, Languages and Programming, ICALP, Heraklion, Crete, Greece, Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001, pp. 615-626.
30. M. Rodeh, V.R. Pratt, S. Even, Linear algorithm for data compression via string matching, J. ACM 28 (1) (1981) 16-24.
31. J. A. Storer, Data Compression: Methods and Theory, Computer Science Press, Rockville, MD, 1988.