Matching statistics speed up BWT construction

DOI10.4230/LIPICS.ESA.2023.83MaRDI QIDQ6657047zbMATH OpenFDO

Authors Francesco Masillo

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.83

zbMATH Keywords

Burrows-Wheeler transformcompressed representationdata structuresefficient algorithmsmatching statisticsstring collections

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(2)

• Matching statistics -- a survey
• Fast and memory-efficient bwt construction of repetitive texts using Lyndon grammars

This page was built for publication: Matching statistics speed up BWT construction

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