Home
Scholarly Works
Understanding maximal repetitions in strings
Journal article

Understanding maximal repetitions in strings

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.

Authors

Crochemore M; Ilie L

Journal

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science Stacs 2008, , , pp. 11–16

Publication Date

January 1, 2008

Contact the Experts team