Understanding maximal repetitions in strings

Details Understanding maximal repetitions in strings Understanding maximal repetitions in strings

2008-02-20

arxiv.org/abs/0802.2829v1

Dans Proceedings of the 25th Annual Symposium on the Theoretical Aspects of Computer Science - STACS 2008, Bordeaux : France (

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Understanding maximal repetitions in strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Understanding maximal repetitions in strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Understanding maximal repetitions in strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-647750