Hierarchical Interleaved Bloom Filter: enabling ultrafast, approximate sequence queries

Abstract

Abstract 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, index size, and search time while achieving a comparable or better accuracy compared to other state-of-the-art tools. The HIBF builds an index up to 211 times faster, using up to 14 times less space, and can answer approximate membership queries faster by a factor of up to 129.

Keywords

• Approximate membership query
• Sequence search
• Miminizer
• Alignment free analysis
• Bloom filter
• Metagenomics