Inducing the Lyndon array

DOI10.1007/978-3-030-32686-9_10zbMATH Open1539.68381MaRDI QIDQ6536249FDOQ6536249

Authors: Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, M. Sciortino, Guilherme P. Telles 

Publication date: 19 April 2024

Recommendations

• Lyndon array construction during Burrows-Wheeler inversion
• Suffix array and Lyndon factorization of a text
• Inducing the LCP-array
• Extended suffix array construction using Lyndon factors
• Algorithm Theory - SWAT 2004

zbMATH Keywords

suffix arrayLyndon arrayinduced suffix sortinglightweight algorithms

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites Work

• Suffix Arrays: A New Method for On-Line String Searches
• A unifying look at data structures
• The ``runs theorem
• Space efficient linear time construction of suffix arrays
• Optimal suffix sorting and LCP array construction for constant alphabets
• Inducing the LCP-array
• Two Efficient Algorithms for Linear Time Suffix Array Construction
• Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
• Lyndon words, permutations and trees.
• Inducing enhanced suffix arrays for string collections
• Linear-time suffix sorting -- a new approach for suffix array construction
• Lyndon array construction during Burrows-Wheeler inversion
• Cartesian and Lyndon trees

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)