Bloom Filter Trie – A Data Structure for Pan-Genome Storage

DOI10.1007/978-3-662-48221-6_16zbMath1367.92034OpenAlexW616987689MaRDI QIDQ5283830

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

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)

Related Items (2)

Representation of $$k$$-mer Sets Using Spectrum-Preserving String Sets ⋮ Rainbowfish: A Succinct Colored de Bruijn Graph Representation

Cites Work

• Unnamed Item
• Unnamed Item
• Scaling metagenome sequence assembly with probabilistic de Bruijn graphs
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Bloom Filter Trie – A Data Structure for Pan-Genome Storage