Understanding maximal repetitions in strings
Data Structures and Algorithms
2008-02-21 v1 Combinatorics
Abstract
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simple proof of this result. As a consequence of our approach, the stronger result concerning the linearity of the sum of exponents of all runs follows easily.
Cite
@article{arxiv.0802.2829,
title = {Understanding maximal repetitions in strings},
author = {Maxime Crochemore and Lucian Ilie},
journal= {arXiv preprint arXiv:0802.2829},
year = {2008}
}