De Novo NGS Data Compression

DOI10.1007/978-3-319-59826-0_4MaRDI QIDQ3305522zbMATH OpenOpenAlexFDO

Authors Gaetan Benoit, C. Lemaitre, Guillaume Rizk, Erwan Drezen, D. Lavenier

Publication date 7 August 2020

Published in Algorithms for Next-Generation Sequencing Data (Search for Journal in Brave)

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

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)

Recommendations

• Compressed Genotyping
• Compression of Whole Genome Alignments
• Next generation sequencing under de novo genome assembly
• Efficient compressed genomic data oriented query approach
• A new challenge for compression algorithms: Genetic sequences
• Efficient construction of a compressed de Bruijn graph for pan-genome analysis

Cites work

• A Method for the Construction of Minimum-Redundancy Codes
• A universal algorithm for sequential data compression
• scientific article; zbMATH DE number 3062467 (Why is no real title available?)

Cited in

(2)

• Dynamic alignment-free and reference-free read compression
• Improved compression of DNA sequencing data with cascading Bloom filters

Describes a project that uses

Uses Software

• Samtools
• SCALCE
• BWA

This page was built for publication: De Novo NGS Data Compression

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