Dynamic alignment-free and reference-free read compression

DOI10.1007/978-3-319-56970-3_4zbMath1382.68059OpenAlexW2598359832MaRDI QIDQ1706503

Roland Wittler, Faraz Hach, Jens Stoye, Guillaume Holley

Publication date: 22 March 2018

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

Mathematics Subject Classification ID

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

Related Items (3)

The complexity of approximate pattern matching on de Bruijn graphs ⋮ DARRC ⋮ A tale of optimizing the space taken by de Bruijn graphs

Uses Software

• GitHub
• SCALCE
• ZSTD
• MaSuRCA

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