| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437594 | Theoretical Computer Science | 2011 | 11 Pages |
Abstract
The “runs” conjecture, proposed by Kolpakov and Kucherov (1999) [7], states that the number of occurrences of maximal repetitions (runs) in a string of length n, , is at most n. We almost solve the conjecture by proving that . This bound is obtained using a combination of theory and computer verification.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
