Bloom filter trie -- a data structure for pan-genome storage

DOI10.1007/978-3-662-48221-6_16zbMATH Open1367.92034OpenAlexW616987689MaRDI QIDQ5283830FDOQ5283830

Authors: Guillaume Holley, Roland Wittler, Jens Stoye 

Publication date: 25 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48221-6_16

Recommendations

• Efficient construction of a compressed de Bruijn graph for pan-genome analysis
• PanCake: a data structure for pangenomes
• Succinct de Bruijn graphs
• Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
• Bidirectional variable-order de Bruijn graphs

zbMATH Keywords

Bloom filter triecolored de-Bruijn graph

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Data structures (68P05) Computational methods for problems pertaining to biology (92-08)

Cites Work

• Space/time trade-offs in hash coding with allowable errors
• An experimental study of an opportunistic index
• Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
• PanCake: a data structure for pangenomes

Cited In (6)

• Representation of \(k\)-mer sets using spectrum-preserving string sets
• Efficient construction of a compressed de Bruijn graph for pan-genome analysis
• PanCake: a data structure for pangenomes
• An index for sequencing reads based on the colored de Bruijn graph
• Dynamic alignment-free and reference-free read compression
• Rainbowfish: a succinct colored de Bruijn graph representation

This page was built for publication: Bloom filter trie -- a data structure for pan-genome storage

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