On the maximal sum of exponents of runs in a string

10Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v with a period p such that 2p≤|v|. The exponent of a run is defined as |v|/p and is greater than or equal to 2. We show new bounds on the maximal sum of exponents of runs in a string of length n. Our upper bound of 4.1n is better than the best previously known proven bound of 5.6n by Crochemore and Ilie (2008). The lower bound of 2.035n, obtained using a family of binary words, contradicts the conjecture of Kolpakov and Kucherov (1999), that the maximal sum of exponents of runs in a string of length n is smaller than 2n. © 2011 Elsevier B.V.

Cite

CITATION STYLE

APA

Crochemore, M., Kubica, M., Radoszewski, J., Rytter, W., & Waleń, T. (2012). On the maximal sum of exponents of runs in a string. In Journal of Discrete Algorithms (Vol. 14, pp. 29–36). https://doi.org/10.1016/j.jda.2011.12.016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free