The abstract is read at the publisher; the summary is JClub's.
Dynamic Hierarchical Interleaved Bloom Filter enables updatable approximate sequence search, building an index from over 100 TB across more than 39,000 human RNA-Seq samples and inserting 5,000 samples in 5.3 hours.
- Why it matters: Growing public sequencing repositories make static indexes costly to rebuild, creating a need for scalable tools that support efficient updates for approximate short-pattern searches.
- What they did: The authors extend the Hierarchical Interleaved Bloom Filter with partial rebuilding to allow dynamic updates, then benchmark incremental insertion on 5,000 samples sub-sampled to 1% read depth.
- The result: In that setting, Dynamic HIBF inserts all 5,000 samples in 5.3 hours, achieving 23 to 42× faster than competing methods and 2× faster than the static HIBF.
The findingWhy it mattersWhat they didThe result
AI summary of the abstract · may contain errors · not medical advice · read the paper.