Repetitions in strings: Algorithms and combinatorics

Theoretical Computer Science

Volumn 410, Issue 50, 2009, Pages 5227-5235

  Crochemore, Maxime ^a,b   Ilie, Lucian ^c   Rytter, Wojciech ^d,e  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITÉ PARIS EST   (France)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

^d UNIVERSITY OF WARSAW   (Poland)

^e NICOLAUS COPERNICUS UNIVERSITY   (Poland)

Author keywords

Algorithms; Compression; Consecutive repeats; Cubes; Factorisation; Repetitions; Runs; Squares; Tandem repeats

Indexed keywords

COMPRESSION; CONSECUTIVE REPEATS; CUBES; FACTORISATION; REPETITIONS; RUNS; SQUARES; TANDEM REPEATS;

FACTORIZATION; GEOMETRY;

ALGORITHMS;

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

References (47)

1. Apostolico A., and Preparata F.P. Optimal off-line detection of repetitions in a string. Theoret. Comput. Sci. 22 3 (1983) 297-315
2. Baturo P., Piatkowski M., and Rytter W. The number of runs in Sturmian words. Proc. of CIAA. Lecture Notes in Comput. Sci. vol. 5148 (2008), Springer 252-261
3. Berstel J., and Savelli A. Crochemore factorization of Sturmian and other infinite strings. Proc. of MFCS. Lecture Notes in Comput.~Sci. vol. 4162 (2006), Springer 157-166
4. Chen G., Puglisi S.J., and Smyth W.F. Fast and practical algorithms for computing all runs in a string. Proc. of CPM'07. Lecture Notes in Comput. Sci. vol. 4580 (July 2007), Springer, Berlin 307-315
5. Constantinescu S., and Ilie L. The Lempel-Ziv complexity of fixed points of morphisms. SIAM J. Discrete Math. 21 2 (2007) 466-481
6. Crochemore M. An optimal algorithm for computing the repetitions in a string. Inform. Process. Lett. 12 5 (1981) 244-250
7. Crochemore M. Transducers and repetitions. Theoret. Comput. Sci. 45 1 (1986) 63-86
8. Crochemore M., Fazekas S.~Z., Iliopoulos C., and Jayasekera I. Bounds on powers in strings. Developments in Language Theory. Lecture Notes in Comput. Sci. vol. 5257 (2008), Springer 206-215
9. Crochemore M., Hancart C., and Lecroq T. Algorithms on Strings (2007), Cambridge Univ. Press
10. Crochemore M., and Ilie L. Analysis of maximal repetitions in strings. Proc. of MFCS'07. Lecture Notes in Comput. Sci. vol. 4708 (2007), Springer 465-476
11. Crochemore M., and Ilie L. Maximal repetitions in strings. J. Comput. Syst. Sci. 74 (2008) 796-807
12. Crochemore M., and Ilie L. Computing longest previous factors in linear time and applications. Inform. Process. Lett. 106 2 (2008) 75-80
13. Crochemore M., Ilie L., and Smyth W.F. A simple algorithm for computing the Lempel-Ziv factorization. 18th Data Compression Conference (2008), IEEE Computer Society, Los Alamitos, CA 482-488
14. Crochemore M., Ilie L., and Tinta L. Towards a solution to the "runs" conjecture. Proc. of CPM'08. Lecture Notes in Comput. Sci. vol. 5029 (2008), Springer 290-302
15. Crochemore M., and Perrin D. Two-way string matching. J. ACM 38 3 (1991) 651-675
16. Crochemore M., and Rytter W. Squares, cubes, and time-space efficient string searching. Algorithmica 13 5 (1995) 405-425
17. Crochemore M., and Rytter W. Jewels of Stringology (2003), World Scientific, Singapore
18. Franek F., Karaman A., and Smyth W.F. Repetitions in Sturmian strings. Theoret. Comput. Sci. 249 2 (2000) 289-303
19. Fraenkel A.S., and Simpson R.J. How many squares can a string contain?. J. Combin. Theory Ser. A 82 (1998) 112-120
20. Fraenkel A.S., and Simpson R.J. The exact number of squares in Fibonacci strings. Theoret. Comput. Sci. 218 1 (1999) 95-106
21. Franek F., and Yang Q. An asymptotic lower bound for the maximal number of runs in a string. Int. J. Found. Comput. Sci. 19 1 (2008) 195-203
22. Franek F., Smyth W.F., and Tang Y. Computing all repeats using suffix arrays. J. Autom. Lang. Comb. 8 4 (2003) 579-591
23. Galil Z., and Seiferas J. Time-space-optimal string matching. J. Comput. Syst. Sci. 26 3 (1983) 280-294
24. Gasieniec L., Plandowski W., and Rytter W. Constant-space string matching with smaller number of comparisons: Sequential sampling. Proc. of CPM'95. Lecture Notes in Comput. Sci. vol. 937 (1995), Springer 78-89
25. M. Giraud, Not so many runs in strings., in: Proc. of LATA'08, Rovira i Virgili University, 2008, pp. 245-252
26. Gusfield D. Algorithms on Strings, Trees and Sequences. Computer Science and Computational Biology (1997), Cambridge Univ. Press
27. Gusfield D., and Stoye J. Linear time algorithms for finding and representing all the tandem repeats in a string. J. Comput. Syst. Sci. 69 4 (2004) 525-546
28. Ilie L. A simple proof that a string of length n has at most 2 n distinct squares. J. Combin. Theory, Ser. A 112 1 (2005) 163-164
29. Ilie L. A note on the number of squares in a string. Theoret. Comput. Sci. 380 3 (2007) 373-376
30. Iliopoulos C., Moore D., and Smyth W.F. A characterization of the squares in a Fibonacci string. Theoret. Comput. Sci. 172 (1997) 281-291
31. Karhumäki J. On strongly cube-free ω-words generated by binary morphisms. Fundamentals of Computation Theory. Lecture Notes in Comput. Sci. 117 (1981), Springer 182-189
32. Kolpakov R., and Kucherov G. Finding maximal repetitions in a string in linear time. 40th Symposium on Foundations of Computer Science (1999), IEEE Computer Society Press, Los Alamitos 596-604
33. Lothaire M. Algebraic Combinatorics on Words (2002), Cambridge University Press
34. Lothaire M. Applied Combinatorics on Words (2005), Cambridge University Press
35. MacDonald M., and Ambrose C.M. A novel gene containing a trinucleotide repeat that is expanded and unstable on Huntington's disease chromosomes. Cell 72 6 (1993) 971-983
36. Main M.G. Detecting leftmost maximal periodicities. Discret. Appl. Math. 25 (1989) 145-153
37. Main M.G., and Lorentz R.J. An O (n log n) algorithm for finding all repetitions in a string. J. Algorithms 5 3 (1984) 422-432
38. W. Matsubara, K. Kusano, A. Ishino, H. Bannai, A. Shinohara, New Lower Bounds for the Maximum Number of Runs in a string, in: Prague Stringology Conference, Czech Technical Univ. in Prague, 2008, pp. 140-144
39. Mignosi F., and Pirillo G. Repetitions in the Fibonacci infinite word. RAIRO Inform. Théor. Appl. 26 3 (1992) 199-204
40. Puglisi S.J., Simpson J., and Smyth B. How many runs can a string contain?. Theor. Comput. Sci. 401 1-3 (2008) 165-171
41. Rytter W. The structure of subword graphs and suffix trees of Fibonacci words. Theor. Comput. Sci. 363 2 (2006) 211-223
42. Rytter W. The number of runs in a string: Improved analysis of the linear upper bound. Proc. of the 23rd STACS. Lecture Notes in Comput. Sci. 3884 (2006), Springer, Berlin 184-195
43. Rytter W. The number of runs in a string. Inf. Comput. 205 9 (2007) 459-1469
44. Smyth W.F. Repetitive perhaps, but certainly not boring. Theoret. Comput. Sci. 249 2 (2000) 343-355
45. Smyth W.F. Computing Patterns in Strings (2003), Addison-Wesley
46. Thue A. Über unendliche Zeichenreihen. Kra. Vidensk. Selsk. Skrifter. I. Mat.-Nat. Kl., Cristiana 7 (1906)
47. Witten I.H., Moffat A., and Bell T.C. Managing Gigabytes (1994), Van Nostrand Reinhold, New York