Sparse binary relation representations for genome graph annotation

DOI10.1007/978-3-030-17083-7_8MaRDI QIDQ2415255zbMATH OpenOpenAlexFDO

Authors Mikhail Karasikov, Harun Mustafa, Amir Joudaki, Sara Javadzadeh-No, Gunnar Rätsch, André Kahles

Publication date 21 May 2019

Full work available at URL http://hdl.handle.net/20.500.11850/393658

zbMATH Keywords

compressionbinary relationsgenome graph annotationsparse binary matrices

Mathematics Subject Classification ID

Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20)

Recommendations

• Improved compression of DNA sequencing data with cascading Bloom filters
• Compression of Multiple k-Mer Sets by Iterative SPSS Decomposition
• Efficient compressed genomic data oriented query approach
• Succinct de Bruijn graphs
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections

Cited in

(3)

• Compression of Multiple k-Mer Sets by Iterative SPSS Decomposition
• Efficient compressed genomic data oriented query approach
• Improved compression of DNA sequencing data with cascading Bloom filters

This page was built for publication: Sparse binary relation representations for genome graph annotation

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