Cartesian and Lyndon trees
From MaRDI portal
Publication:2285120
DOI10.1016/j.tcs.2018.08.011zbMath1436.68274arXiv1712.08749OpenAlexW2885974306WikidataQ61677815 ScholiaQ61677815MaRDI QIDQ2285120
Luís M. S. Russo, Maxime Crochemore
Publication date: 16 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.08749
Related Items (6)
Linear construction of a left Lyndon tree ⋮ On generalized Lyndon words ⋮ Lyndon partial words and arrays with applications ⋮ String rearrangement inequalities and a total order between primitive words ⋮ Unnamed Item ⋮ Range minimum queries in minimal space
Cites Work
- Unnamed Item
- Unnamed Item
- Suffix array and Lyndon factorization of a text
- Lyndon words, permutations and trees.
- The maximal number of cubic runs in a word
- Near-optimal computation of runs over general alphabet via non-crossing LCE queries
- A unifying look at data structures
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Faster Longest Common Extension Queries in Strings over General Alphabets
- Algorithms on Strings
This page was built for publication: Cartesian and Lyndon trees
