Maximal repetitions in strings

  title={Maximal repetitions in strings},
  author={Maxime Crochemore and Lucian Ilie},
  journal={J. Comput. Syst. Sci.},
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the most important part of the analysis of the running time of such algorithms is counting the number of runs. Kolpakov and Kucherov [FOCS’99] proved it to be cn but could not provide any value for c. Recently, Rytter [STACS’06] proved that c ≤ 5. His analysis has been improved by Puglisi et al. to obtain 3.48 and by… CONTINUE READING
39 Citations
22 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 22 references

The maximum number of runs in a string

  • F. Franek, R. J. Simpson, W. F. Smyth
  • Proc. 14th Australasian Workshop on Combinatorial…
  • 2003
Highly Influential
3 Excerpts

A characterization of the squares in a Fibonacci string , Theoret

  • D. Moore, W. F. Smyth
  • Theoret . Comput . Sci .
  • 2007

A simple proof that the number of runs in a word is linear

  • M. Crochemore, L. Ilie
  • 2006
2 Excerpts

Algebraic Combinatorics on Words

  • M. Lothaire
  • Cambridge Univ. Press
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…