Results 21 to 30 of about 83,383 (194)
Generalized Lyndon Factorizations of Infinite Words [PDF]
Theoretical Computer Science, 2019 14 pages, 1 ...
Amanda Burcroff, Eric Winsor
openaire +3 more sources
A characterization of infinite smooth Lyndon words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Combinatorics
Geneviève Paquin
doaj +1 more source
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Alternative algorithms for Lyndon factorization.
CoRR, 2014 We present two variations of Duval's algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip a significant portion of the characters of the string, for strings containing runs of the smallest character in the alphabet.
Ghuman, Sukhpal Singh +3 more
openaire +6 more sources
The Electronic Journal of Combinatorics, 2017 In this paper, we determine the maximum number of distinct Lyndon factors that a word of length $n$ can contain. We also derive formulas for the expected total number of Lyndon factors in a word of length $n$ on an alphabet of size $\sigma$, as well as the expected number of distinct Lyndon factors in such a word.
Glen, A., Simpson, J., Smyth, W.F.
openaire +4 more sources
Quasiperiodic and Lyndon episturmian words [PDF]
, 2008 Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if, it is an infinite Lyndon word.
Amy Glen +8 more
core +1 more source
Unbordered factors and Lyndon words
Discrete Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean-Pierre Duval +2 more
openaire +3 more sources
On the density of Lyndon roots in factors
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Crochemore, Maxime, Mercas, Robert
openaire +5 more sources
Evolutionary search techniques for the Lyndon factorization of biosequences [PDF]
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019 A non-empty string x over an ordered alphabet is said to be a Lyndon word if it is alphabetically smaller than all of its cyclic rotations. Any string can be uniquely factored into Lyndon words and efficient algorithms exist to perform the factorization process in linear time and constant space.
Amanda Clare +3 more
openaire +1 more source
Sorting suffixes of a text via its Lyndon Factorization [PDF]
CoRR, 2013 Submitted to the Prague Stringology Conference 2013 (PSC 2013)
MANTACI, Sabrina +3 more
openaire +3 more sources