A run in a word is a periodic factor whose length is at least twice its period and which cannot be extended to the left or right (by a letter) to a factor with greater period. In recent years a great deal of work has been done on estimating the maximum number of runs that can occur in a word of length n. A number of associated problems have also been investigated. In this paper we consider a new variation on the theme. We say that the total run length (TRL) of a word is the sum of the lengths of the runs in the word and that τ(n) is the maximum TRL over all words of length n. We show that n2/8<τ(n)<47n2/72+2nn2/8<τ(n)<47n2/72+2n for all n. We also give a formula for the average total run length of words of length n over an alphabet of size ...
International audienceSince the work of Kolpakov and Kucherov in 1998, it is known that \rho(n), the...
AbstractThe notion of run (also called maximal repetition) allows a compact representation of the se...
AbstractThe “runs” conjecture, proposed by Kolpakov and Kucherov (1999) [7], states that the number ...
A run in a word is a periodic factor whose length is at least twice its period and which cannot be e...
International audienceIt is not known that the maximum number of runs in a word of length n is attai...
AbstractA run is an inclusion maximal occurrence in a word (as a subinterval) of a factor in which t...
International audienceA run is an inclusion maximal occurrence in a word (as a subinterval) of a fac...
AbstractA run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v wi...
A word is a sequence of symbols taken from a (usually finite) alphabet. A run of period p in a word ...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a r...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a f...
AbstractA run in a string is a nonextendable (with the same minimal period) periodic segment in a st...
AbstractGiven a string x=x[1..n], a repetition of period p in x is a substring ur=x[i+1..i+rp], p=∣u...
A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v with a per...
In 2000 Kolpakov and Kucherov showed that the maximum number ρ(n) of runs in any string x[1..n] is O...
International audienceSince the work of Kolpakov and Kucherov in 1998, it is known that \rho(n), the...
AbstractThe notion of run (also called maximal repetition) allows a compact representation of the se...
AbstractThe “runs” conjecture, proposed by Kolpakov and Kucherov (1999) [7], states that the number ...
A run in a word is a periodic factor whose length is at least twice its period and which cannot be e...
International audienceIt is not known that the maximum number of runs in a word of length n is attai...
AbstractA run is an inclusion maximal occurrence in a word (as a subinterval) of a factor in which t...
International audienceA run is an inclusion maximal occurrence in a word (as a subinterval) of a fac...
AbstractA run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v wi...
A word is a sequence of symbols taken from a (usually finite) alphabet. A run of period p in a word ...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a r...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a f...
AbstractA run in a string is a nonextendable (with the same minimal period) periodic segment in a st...
AbstractGiven a string x=x[1..n], a repetition of period p in x is a substring ur=x[i+1..i+rp], p=∣u...
A run is an inclusion maximal occurrence in a string (as a subinterval) of a repetition v with a per...
In 2000 Kolpakov and Kucherov showed that the maximum number ρ(n) of runs in any string x[1..n] is O...
International audienceSince the work of Kolpakov and Kucherov in 1998, it is known that \rho(n), the...
AbstractThe notion of run (also called maximal repetition) allows a compact representation of the se...
AbstractThe “runs” conjecture, proposed by Kolpakov and Kucherov (1999) [7], states that the number ...