PFP Compressed Suffix Trees

DOI10.1137/1.9781611976472.5MaRDI QIDQ5147525zbMATH OpenOpenAlexFDO

Authors Christina Boucher, Ondřej Cvacho, Travis Gagie, Jan Holub, Giovanni Manzini, Massimiliano Rossi, Gonzalo Navarro

Publication date 27 January 2021

Published in 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611976472.5

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(4)

• Computational graph pangenomics: a tutorial on data structures and their applications
• Computing MEMs and relatives on repetitive text collections
• Computing the original eBWT faster, simpler, and with less memory
• Faster repetition-aware compressed suffix trees based on block trees

This page was built for publication: PFP Compressed Suffix Trees

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