Chapter

Combinatorial Pattern Matching

Volume 5029 of the series Lecture Notes in Computer Science pp 290-302

Towards a Solution to the “Runs” Conjecture

  • Maxime CrochemoreAffiliated withDepartment of Computer Science, King’s College LondonInstitut Gaspard-Monge, Université Paris-Est
  • , Lucian IlieAffiliated withDepartment of Computer Science, University of Western Ontario
  • , Liviu TintaAffiliated withDepartment of Computer Science, University of Western Ontario

* Final gross prices may vary according to local VAT.

Get Access

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.