PFP Compressed Suffix Trees
From MaRDI portal
Publication:5147525
DOI10.1137/1.9781611976472.5OpenAlexW3120098135MaRDI QIDQ5147525
Ondřej Cvacho, Jan Holub, Massimiliano Rossi, Travis Gagie, Christina Boucher, Giovanni Manzini, 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
Related Items
Computing the original eBWT faster, simpler, and with less memory, Faster repetition-aware compressed suffix trees based on block trees, Computational graph pangenomics: a tutorial on data structures and their applications
