Lyndon Factorization is a unique decomposition of a string into a lexicographically non-increasing sequence of Lyndon words, where each Lyndon word is a primitive string that is strictly smaller in lexicographic order than all of its proper suffixes.
33
Publications
836
Citations
55
Authors
54
Institutions
Publications per year
2017–2026
4
Parents
Publications
33
Lyndon factorization of sturmian words
Guy Mélançon · Discrete Mathematics · 2000 · 49 citations
Structure of Polyzetas and Lyndon Words
Hoang Ngoc Minh · Vietnam Journal of Mathematics · 2013 · 42 citations
1–5 of 33
Authors
55
- GM
3
h-index
- YN
3
h-index
- JWJacqueline W. Daykin
Royal Holloway University of London, United Kingdom
3 publications · 54 citations
3
h-index
- JS
3
h-index
- SI
2
h-index
1–5 of 55
Institutions
54
Centre National de la Recherche Scientifique
Paris, France
4 h-index
4 publications
135 citations
Royal Holloway University of London
Egham, United Kingdom
3 h-index
3 publications
54 citations
University of Guelph
Guelph, Canada
3 h-index
4 publications
67 citations
University of Turku
Turku, Finland
2 h-index
2 publications
90 citations
Université de Bordeaux
Bordeaux, France
2 h-index
2 publications
67 citations
University of Reading
Reading, United Kingdom
2 h-index
2 publications
34 citations
Université de Lille
Lille, France
2 h-index
5 publications
170 citations
Turku Centre for Computer Science
Turku, Finland
2 h-index
2 publications
90 citations
1–8 of 54
Venues
- Theoretical Computer Science
8 publications · 229 citations
8
h-index
- Discrete Mathematics
2 publications · 70 citations
3
h-index
- Journal of Discrete Algorithms
3 publications · 53 citations
3
h-index
- International Journal of Foundations of Computer Science
IJFCS · 2 publications · 59 citations
2
h-index
- Algorithmica
1 publications · 11 citations
1
h-index
1–5