Cargando…
Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries
We present a novel data structure for searching sequences in large databases: the Hierarchical Interleaved Bloom Filter (HIBF). It is extremely fast and space efficient, yet so general that it could serve as the underlying engine for many applications. We show that the HIBF is superior in build time...
| Autores principales: | , , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10230713/ https://www.ncbi.nlm.nih.gov/pubmed/37259161 http://dx.doi.org/10.1186/s13059-023-02971-4 |