Prefix-Free Parsing for Building Big BWTs

DOI10.4230/LIPIcs.WABI.2018.2zbMath1494.92083arXiv1803.11245OpenAlexW2946874282MaRDI QIDQ5090326

Christina Boucher, Alan Kuhnle, Travis Gagie, Giovanni Manzini

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1803.11245

zbMATH Keywords

Burrows-Wheeler transformgenomic databasescompression-aware algorithmsprefix-free parsing

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Genetics and epigenetics (92D10) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Efficient construction of the BWT for repetitive text using string compression ⋮ Refining the \(r\)-index

Uses Software

• Big-BWT

Cites Work

• Unnamed Item
• Inducing enhanced suffix arrays for string collections
• Lightweight data indexing and compression in external memory
• Indexing compressed text
• From LZ77 to the run-length encoded burrows-wheeler transform, and back

This page was built for publication: Prefix-Free Parsing for Building Big BWTs