Advertisement

Towards a Solution to the “Runs” Conjecture

  • Maxime Crochemore
  • Lucian Ilie
  • Liviu Tinta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5029)

Abstract

The “runs” conjecture, proposed by [Kolpakov and Kucherov, 1999], states that the number of occurrences of maximal repetitions (runs) in a string of length n is at most n. The best bound to date, due to [Crochemore and Ilie, 2007], is 1.6n. Here we improve very much this bound using a combination of theory and computer verification. Our best bound is 1.048n but actually solving the conjecture seems to be now only a matter of time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Crochemore, M.: An optimal algorithm for computing the repetitions in a word. Inform. Proc. Letters 12, 244–250 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Crochemore, M., Ilie, L.: Maximal repetitions in strings. J. Comput. Syst. Sci. (in press, 2007)Google Scholar
  3. 3.
    Crochemore, M., Ilie, L.: Computing Longest Previous Factor in linear time and applications. Inform. Process. Lett. 106, 75–80 (2008)MathSciNetGoogle Scholar
  4. 4.
    Crochemore, M., Ilie, L., Rytter, W.: Repetitions in strings: algorithms and combinatorics. Theoret. Comput. Sci. (to appear) Google Scholar
  5. 5.
    Franek, F., Simpson, R.J., Smyth, W.F.: The maximum number of runs in a string. In: Miller, M., Park, K. (eds.) Proc. 14th Australasian Workshop on Combinatorial Algorithms, pp. 26–35 (2003)Google Scholar
  6. 6.
    Giraud, M.: Not so many runs in strings. In: Martin-Vide, C. (ed.) Proc. of LATA 2008 (to appear, 2008) Google Scholar
  7. 7.
    Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proc. of FOCS 1999, pp. 596–604. IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
  8. 8.
    Main, M.G.: Detecting lefmost maximal periodicities. Discrete Applied Math. 25, 145–153 (1989)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Main, M.G., Lorentz, R.J.: An O(n log n) algorithm for finding all repetitions in a string. J. Algorithms 5(3), 422–432 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Puglisi, S.J., Simpson, J., Smyth, B.: How many runs can a string contain? (submitted, 2006)Google Scholar
  11. 11.
    Rytter, W.: The number of runs in a string: improved analysis of the linear upper bound. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 184–195. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. 12.
    Rytter, W.: The number of runs in a string. Inf. Comput. 205(9), 1459–1469 (2007)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Maxime Crochemore
    • 1
    • 2
  • Lucian Ilie
    • 3
  • Liviu Tinta
    • 3
  1. 1.Department of Computer ScienceKing’s College LondonLondonUK
  2. 2.Institut Gaspard-MongeUniversité Paris-EstMarne-la-ValléeFrance
  3. 3.Department of Computer ScienceUniversity of Western OntarioLondonCanada

Personalised recommendations