bioRxivBioinformaticsPreprint
Toward space-optimal approximate colored indexes at scale
Abstract
Searching current petabase-scale sequence repositories requires indexes that combine compact storage with high query throughput. Although exact colored indexes retain complete sequence information, their construction and storage costs can become substantial for highly diverse collections. Indexes based on approximate membership query (AMQ) filters offer a compact alternative with fast construction and queries. Being hash-based, these indexes support different seeding schemes without structural changes, while sampling can reduce storage requirements, construction time and query time by an order of magnitude. Within the AMQ framework, querying many independent filters causes scattered memory accesses, reducing throughput. This motivates interleaved filters, which address this weakness by storing filter slots contiguously by position, enabling cache-friendly access and simultaneous membership queries. However, existing implementations face a trade-off between guaranteed construction and space-efficiency. Here, we introduce a new indexing framework based on interleaved ZOR filters, fingerprint-based structures with guaranteed construction that require only approximately 1% more space than the theoretical minimum for AMQ. To exploit redundancy between genomes, we introduce a color-preserving merging mechanism that extends fingerprints with membership bits, allowing multiple genomes to share a filter while retaining their individual identities. Together with a lightweight, sketch-based layout planner, this mechanism yields a compact index structure that accommodates collections with widely varying genome sizes and degrees of similarity. Our third contribution extends the AMQ framework beyond contiguous -mers through a low-density minimizer scheme alongside efficient implementations of sensitive seeds, including gapped -mers and randstrobes. We implement these methods in Zindex, a parallel, SIMD-accelerated Rust index that scales to millions of genomes while supporting diverse seeding and sampling schemes. Zindex indexes the latest RefSeq release of 564,401 assembled genomes in under 22 hours, producing a 289.5 GB index. It further scales to all 2,763,297 genomes of AllTheBacteria, producing a 406.3 GB index in four days with a peak memory footprint of 43.8 GB. Availability. Zindex is available at https://github.com/Malfoy/Zindex
- assay: whole-genome sequencing
- research focus: variant calling
- approach: deep learning
- approach: statistical model
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- fimpera: drastic improvement of Approximate Membership Query data-structures with counts
Lucas Robidou, Pierre Peterlongo·bioRxiv·Jun 27, 2022
- Kaminari: a resource-frugal index for approximate colored k-mer queries
Victor Levallois, Yoshihiro Shibuya, … Giulio Ermanno Pibiri·Bioinformatics AdvancesPeer-reviewed·Jan 1, 2026
- Extracting and Updating Compact Colored k-mer Indexes
Lore Depuydt, Jarno N. Alanko, … Simon J. Puglisi·bioRxiv·Nov 9, 2026
- Fulgor: A fast and compact k-mer index for large-scale matching and color queries
Jason Fan, Noor Singh, … Rob Patro·Algorithms for Molecular BiologyPeer-reviewed·Jan 22, 2024
- Compressed inverted indexes for scalable sequence similarity
Florian Ingels, Léa Vandamme, … Antoine Limasset·bioRxiv·Nov 21, 2025
- Scalable sequence database search using Partitioned Aggregated Bloom Comb-Trees
Camille Marchet, Antoine Limasset·BioinformaticsPeer-reviewed·May 25, 2023