REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets
Camille MarchetiD, Zamin IqbaliD, Daniel GautheretiD, Mikaël SalsoniD, Rayan ChikhiiD
Abstract
MotivationIn this work we present REINDEER, a novel computational method that performs indexing of sequences and records their abundances across a collection of datasets. To the best of our knowledge, other indexing methods have so far been unable to record abundances efficiently across large datasets. ResultsWe used REINDEER to index the abundances of sequences within 2,585 human RNA-seq experiments in 45 hours using only 56 GB of RAM. This makes REINDEER the first method able to record abundances at the scale of 4 billion distinct k-mers across 2,585 datasets. REINDEER also supports exact presence/absence queries of k-mers. Briefly, REINDEER constructs the compacted de Bruijn graph (DBG) of each dataset, then conceptually merges those DBGs into a single global one. Then, REINDEER constructs and indexes monotigs, which in a nutshell are groups of k-mers of similar abundances. Availabilityhttps://github.com/kamimrcht/REINDEER Contactcamille.marchet@univ-lille.fr
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 77
- FWCI
- 3.16
- Field percentile
- top 6%
- Organism
- Assay
- Research Focus
- Approach
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
- REINDEER2: practical abundance index at scale
Yohan Hernandez--Courbevoie, Mikaël Salson, … Antoine Limasset·Lecture notes in computer sciencePeer-reviewed·Sep 21, 2025
- Lossless Indexing with Counting de Bruijn Graphs
Mikhail Karasikov, Harun Mustafa, … André Kahles·bioRxiv·Nov 9, 2021
- K2R: Tinted de Bruijn Graphs implementation for efficient read extraction from sequencing datasets
Léa Vandamme, Bastien Cazaux, Antoine Limasset·Bioinformatics AdvancesPeer-reviewed·Dec 26, 2024
- Data structures based on k-mers for querying large collections of sequencing datasets
Camille Marchet, Christina A. Boucher, … Rayan Chikhi·Genome ResearchPeer-reviewed·Jan 1, 2021
- Back to sequences: find the origin of kmers
Anthony Baire, Pierre Marijon, … Pierre Peterlongo·The Journal of Open Source SoftwarePeer-reviewed·Sep 23, 2024
- Where the patterns are: repetition-aware compression for colored de Bruijn graphs
Alessio Campanelli, Giulio Ermanno Pibiri, … Rob Patro·Journal of Computational BiologyPeer-reviewed·Oct 1, 2024