On maximal repetitions of arbitrary exponent

Authors:
Roman Kolpakov;Gregory Kucherov;Pascal Ochem
Affiliations:
Moscow University, Russian Federation;LIFL and INRIA Lille -- Nord Europe, Lille, France and J.-V. Poncelet Lab., Moscow, Russian Federation;LRI, Orsay, France and J.-V. Poncelet Lab., Moscow, Russian Federation
Venue:
Information Processing Letters
Year:
2010

Citing 2
Cited 1

Combinatorics of words

Handbook of formal languages, vol. 1
Polynomial versus exponential growth in repetition-free binary words

Journal of Combinatorial Theory Series A

Computing the maximal-exponent repeats of an overlap-free string in linear time

SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval

Quantified Score

Hi-index	0.90

Visualization

Abstract

The first two authors have shown [1,2] (Kolpakov and Kucherov, 1999, 2000) that the sum of the exponents (and thus the number) of maximal repetitions of exponent at least 2 in a word (also called runs) is linear with respect to the length of the word. The exponent 2 in the definition of a run may seem arbitrary. In this paper, we consider maximal repetitions of exponent strictly greater than 1.