Inducing the Lyndon array
From MaRDI portal
Publication:6536249
DOI10.1007/978-3-030-32686-9_10zbMATH Open1539.68381MaRDI QIDQ6536249
Sabrina Mantaci, Felipe A. Louza, Giovanni Manzini, M. Sciortino, Guilherme P. Telles
Publication date: 19 April 2024
Cites Work
- Title not available (Why is that?)
- Optimal suffix sorting and LCP array construction for constant alphabets
- Inducing enhanced suffix arrays for string collections
- Lyndon words, permutations and trees.
- Lyndon array construction during Burrows-Wheeler inversion
- Cartesian and Lyndon trees
- Suffix Arrays: A New Method for On-Line String Searches
- Space Efficient Linear Time Construction of Suffix Arrays
- A unifying look at data structures
- Inducing the LCP-Array
- Two Efficient Algorithms for Linear Time Suffix Array Construction
- The “Runs” Theorem
- Linear-time Suffix Sorting - A New Approach for Suffix Array Construction.
This page was built for publication: Inducing the Lyndon array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536249)
