Lyndon words, permutations and trees.
From MaRDI portal
Publication:1426043
DOI10.1016/S0304-3975(03)00099-9zbMath1058.68086MaRDI QIDQ1426043
Christophe Hohlweg, Christophe Reutenauer
Publication date: 14 March 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Extended suffix array construction using Lyndon factors, Lyndon + Christoffel = digitally convex, Lyndon array construction during Burrows-Wheeler inversion, Words over an ordered alphabet and suffix permutations, Linear construction of a left Lyndon tree, Suffix array and Lyndon factorization of a text, Lyndon partial words and arrays with applications, The “Runs” Theorem, Unnamed Item, Counting suffix arrays and strings, A quick tour on suffix arrays and compressed suffix arrays, Unnamed Item, Cartesian and Lyndon trees, Inverse Lyndon words and inverse Lyndon factorizations of words, On the size of the smallest alphabet for Lyndon trees, More properties of the Fibonacci word on an infinite alphabet, Longest Lyndon Substring After Edit
Cites Work
- Combinatorics of Hall trees and Hall words
- Alternating permutations and binary increasing trees
- Sorting tree, nestling tree and inverse permutation
- Counting permutations with given cycle structure and descent set
- Longest Increasing and Decreasing Subsequences
- Factorizing words over an ordered alphabet
- Lyndon Words, Free Algebras and Shuffles
- A unifying look at data structures
- A Space-Economical Suffix Tree Construction Algorithm
- Free differential calculus. IV: The quotient groups of the lower central series
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
