2 research outputs found
On the maximal sum of exponents of runs in a string
A run is an inclusion maximal occurrence in a string (as a subinterval) of a
repetition with a period such that . The exponent of a run
is defined as and is . We show new bounds on the maximal sum of
exponents of runs in a string of length . Our upper bound of is
better than the best previously known proven bound of by Crochemore &
Ilie (2008). The lower bound of , obtained using a family of binary
words, contradicts the conjecture of Kolpakov & Kucherov (1999) that the
maximal sum of exponents of runs in a string of length is smaller than Comment: 7 pages, 1 figur
Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version)
Stoye J, Gusfield D. Simple and Flexible Detection of Contiguous Repeats Using a Suffix Tree (Preliminary Version). In: Proc. of CPM 1998. LNCS. Vol 1448. 1998: 140-152