Lyndon array construction during Burrows-Wheeler inversion
From MaRDI portal
Publication:1632505
DOI10.1016/j.jda.2018.08.001zbMath1486.68261arXiv1710.10105OpenAlexW3098936105MaRDI QIDQ1632505
W. F. Smyth, Giovanni Manzini, Felipe A. Louza, Guilherme P. Telles
Publication date: 14 December 2018
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10105
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient fully-compressed sequence representations
- Lyndon words, permutations and trees.
- Fully Functional Static and Dynamic Succinct Trees
- Compressed representations of sequences and full-text indexes
- Suffix Arrays: A New Method for On-Line String Searches
- Indexing compressed text
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
- Generating Lyndon brackets.
- Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
- A new characterization of maximal repetitions by Lyndon trees
- Linear-time Suffix Sorting - A New Approach for Suffix Array Construction.
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Free differential calculus. IV: The quotient groups of the lower central series
