Data structures for SMEM-finding in the PBWT

DOI10.1007/978-3-031-43980-3_8MaRDI QIDQ6545416

Dominik Köppl, P. Bonizzoni, Christina Boucher, Davide Cozzi, Massimiliano Rossi, Travis Gagie

Publication date: 29 May 2024

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Data structures (68P05) Computational methods for problems pertaining to biology (92-08)

Cites Work

• LZ77 computation based on the run-length encoded BWT
• Compressed range minimum queries
• Refining the \(r\)-index
• Algorithmics on SLP-compressed strings: A survey
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space
• At the roots of dictionary compression: string attractors

This page was built for publication: Data structures for SMEM-finding in the PBWT

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