Lyndon Words Accelerate Suffix Sorting.

DOI10.4230/LIPICS.ESA.2021.15MaRDI QIDQ6075900zbMATH OpenOpenAlexFDO

Authors Jonas Ellert, Johannes Fischer

Publication date 20 September 2023

Full work available at URL https://doi.org/10.4230/LIPIcs.ESA.2021.15

zbMATH Keywords

Lyndon wordsstring algorithmssuffix arraysuffix sorting

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(6)

• On the optimisation of the GSACA suffix array construction algorithm
• Constructing and indexing the bijective and extended Burrows-Wheeler transform
• Lyndon arrays simplified
• Generic non-recursive suffix array construction
• Unveiling the connection between the Lyndon factorization and the canonical inverse Lyndon factorization via a border property
• Fast and memory-efficient bwt construction of repetitive texts using Lyndon grammars

This page was built for publication: Lyndon Words Accelerate Suffix Sorting.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6075900)