Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis

DOI10.1007/978-3-319-19929-0_4zbMath1432.68602OpenAlexW820014006MaRDI QIDQ2942244

Timo Beller, Enno Ohlebusch

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_4

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Protein sequences, DNA sequences (92D20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Genetics and epigenetics (92D10) Algorithms on strings (68W32)

Related Items (2)

Extending Maximal Perfect Haplotype Blocks to the Realm of Pangenomics ⋮ Wheeler graphs: a framework for BWT-based data structures

Cites Work

• Unnamed Item
• Unnamed Item
• New algorithms on wavelet trees and applications to information retrieval
• Replacing suffix trees with enhanced suffix arrays
• Computing the longest common prefix array based on the Burrows-Wheeler transform
• Fast BWT in small space by blockwise suffix sorting
• Lightweight Data Indexing and Compression in External Memory
• From Indexing Data Structures to de Bruijn Graphs
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections

This page was built for publication: Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis