Dynamic alignment-free and reference-free read compression

DOI10.1007/978-3-319-56970-3_4zbMATH Open1382.68059OpenAlexW2598359832MaRDI QIDQ1706503FDOQ1706503

Authors: Guillaume Holley, Roland Wittler, Jens Stoye, Faraz Hach 

Publication date: 22 March 2018

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

Recommendations

• Improved compression of DNA sequencing data with cascading Bloom filters
• Optimizing Read Reversals for Sequence Compression
• De Novo NGS Data Compression
• Bloom filter trie -- a data structure for pan-genome storage
• Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval

Mathematics Subject Classification ID

Applications of graph theory (05C90) Systems biology, networks (92C42) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cited In (6)

• A tale of optimizing the space taken by de Bruijn graphs
• DARRC
• The complexity of approximate pattern matching on de Bruijn graphs
• Optimizing Read Reversals for Sequence Compression
• Title not available (Why is that?)
• PanCake: a data structure for pangenomes

Uses Software

• SCALCE
• ZSTD
• MaSuRCA
• GitHub

This page was built for publication: Dynamic alignment-free and reference-free read compression

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