Add to ORKGInternational audienceThis work takes another look at the number of runs that a string may contain and provides an alternative proof for the bound. We also propose another stronger conjecture that states the following: for a fixed order on the alphabet, within every factor of a word there are at most as many occurrences of Lyndon roots corresponding to runs in the word as the length of the factor. Only first occurrences of roots in each run are considered
The Lyndon factorization of a word has been largely studied and recently variants of it have been in...
A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number...
International audienceWe show a Theta(n log n) bound on the maximal number of occurrences of primiti...
International audienceThis work takes another look at the number of runs that a string may contain a...
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n ca...
International audienceA non-empty word w of {a; b}* is a Lyndon word if and only if it is strictly s...
A word is a sequence of symbols taken from a (usually finite) alphabet. A run of period p in a word ...
We previously proved that almost all words of length n over a finite alphabet A with m letters cont...
AbstractWe previously proved that almost all words of length n over a finite alphabet A with m lette...
A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a f...
In this note we consider the concept of alphabet ordering in the context of string factoring. We pro...
International audienceA non-empty word w is a Lyndon word if and only if it is strictly smaller for ...
Given a string x = x[1..n] on an ordered alphabet of size σ, the Lyndon array λ = λx[1..n] of x is a...
International audienceA run is an inclusion maximal occurrence in a word (as a subinterval) of a fac...
The Lyndon factorization of a word has been largely studied and recently variants of it have been in...
A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number...
International audienceWe show a Theta(n log n) bound on the maximal number of occurrences of primiti...
International audienceThis work takes another look at the number of runs that a string may contain a...
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n ca...
International audienceA non-empty word w of {a; b}* is a Lyndon word if and only if it is strictly s...
A word is a sequence of symbols taken from a (usually finite) alphabet. A run of period p in a word ...
We previously proved that almost all words of length n over a finite alphabet A with m letters cont...
AbstractWe previously proved that almost all words of length n over a finite alphabet A with m lette...
A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number...
International audienceA run is an inclusion maximal occurrence in a string (as a subinterval) of a f...
In this note we consider the concept of alphabet ordering in the context of string factoring. We pro...
International audienceA non-empty word w is a Lyndon word if and only if it is strictly smaller for ...
Given a string x = x[1..n] on an ordered alphabet of size σ, the Lyndon array λ = λx[1..n] of x is a...
International audienceA run is an inclusion maximal occurrence in a word (as a subinterval) of a fac...
The Lyndon factorization of a word has been largely studied and recently variants of it have been in...
A breakthrough in the field of text algorithms was the discovery of the fact that the maximal number...
International audienceWe show a Theta(n log n) bound on the maximal number of occurrences of primiti...