Kaminari: a frugal colored index for approximate k -mer queries
Bioinformatics Advances · 07.01.2026 · 6 (1)
DOI: 10.1093/bioadv/vbag120 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bioinformatics Advances, online erschienen am 26.04.2026. Verfasst von Victor Levallois und 6 weiteren Autor:innen. Beteiligte Einrichtung: GenScale, University of Rennes, Inria, CNRS, IRISA-UMR 6074, Rennes, F-35000, France. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 45 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Motivation Identifying which documents in a large database contain a query string is a fundamental problem in Information Retrieval and Computational Biology. We focus on the approximate version of this problem for genomic sequences: the result set may contain false positive matches but no false negatives. State-of-the-art solutions rely on Bloom filters to index all k-mers (substrings of fixed length k) in the documents. To answer a query, documents sharing at least a user-prescribed fraction of query k-mers (typically 75%–80%) are returned. Results Here, we explore an alternative index design based on k-mer minimizers and integer compression methods. We show that a careful implementation of this design outperforms previous solutions based on Bloom filters by a wide margin: the index has lower memory footprint and faster query times, while false positive matches have only a minor impact on the ranking of the documents reported. This trend is robust across genomic datasets of different complexity and query workloads. Availability and implementation The software is freely available at github.com/yhhshb/kaminari under the MIT license. Reproducibility scripts are available at github.com/vicLeva/benchmarks_kaminari.
Autor:innen und Institutionen
- GenScale, University of Rennes, Inria, CNRS, IRISA-UMR 6074, Rennes, F-35000, France.
- Sequence Bioinformatics Unit, Institut Pasteur, Paris, F-75015, France.
- University of Rennes, Rennes, F-35000, France.
- Univ. Lille, CNRS, Centrale Lille, UMR 9189 CRIStAL, Lille, F-59000, France.
- Bioinformatics and Biostatistics Hub, Institut Pasteur, Université de Paris, Paris, F-75015, France.
- Department of Computer Science, University of Maryland, College Park, MD 20440, United States.
ORCID-Profile: Victor Levallois, Yoshihiro Shibuya, Yoann Dufresne, Rob Patro, Pierre Peterlongo
Zitieren
APA
Levallois, V., Shibuya, Y., Le Gal, B., Dufresne, Y., Patro, R., Peterlongo, P., & Pibiri, G. E. (2026). Kaminari: a frugal colored index for approximate k -mer queries. Bioinformatics Advances, 6(1). https://doi.org/10.1093/bioadv/vbag120
Vancouver
Levallois V, Shibuya Y, Le Gal B, Dufresne Y, Patro R, Peterlongo P, et al. Kaminari: a frugal colored index for approximate k -mer queries. Bioinformatics Advances. 2026;6(1). doi:10.1093/bioadv/vbag120
BibTeX
@article{Levallois2026,
author = {Levallois, Victor and Shibuya, Yoshihiro and Le Gal, Bertrand and Dufresne, Yoann and Patro, Rob and Peterlongo, Pierre and Pibiri, Giulio Ermanno},
title = {Kaminari: a frugal colored index for approximate k -mer queries},
journal = {Bioinformatics Advances},
year = {2026},
volume = {6},
number = {1},
doi = {10.1093/bioadv/vbag120}
}
EUVIMED