NatureBioinformaticsPeer-reviewed journal article
Indexing All Life's Known Biological Sequences
Mikhail KarasikoviD, Harun MustafaiD, Daniel DanciuiD, Oleksandr Kulkov, Marc Zimmermann, Christopher Barber, Gunnar RätschiD, André KahlesiD
Abstract
The amount of biological sequencing data available in public repositories is growing exponentially, forming an invaluable biomedical research resource. Yet, making it full-text searchable and easily accessible to researchers in life and data science is an unsolved problem. In this work, we take advantage of recently developed, very efficient data structures and algorithms for representing sequence sets. We make Petabases of DNA sequences across all clades of life, including viruses, bacteria, fungi, plants, animals, and humans, fully searchable. Our indexes are freely available to the research community. This highly compressed representation of the input sequences (up to 5800x) fits on a single consumer hard drive ({approx}100 USD), making this valuable resource cost-effective to use and easily transportable. We present the underlying methodological framework, called MetaGraph, that allows us to scalably index very large sets of DNA or protein sequences using annotated De Bruijn graphs. We demonstrate the feasibility of indexing the full extent of existing sequencing data and present new approaches for efficient and cost-effective full-text search at an on-demand cost of $0.10 per queried Mpb. We explore several practical use cases to mine existing archives for interesting associations and demonstrate the utility of our indexes for integrative analyses.
- assay: DNA methylation
- assay: whole-genome sequencing
- research focus: database / resource
- approach: statistical model
- Citations
- 32
- FWCI
- 12.79
- Field percentile
- top 1%
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
- Lossless Indexing with Counting de Bruijn Graphs
Mikhail Karasikov, Harun Mustafa, … André Kahles·bioRxiv·Nov 9, 2021
- Improved Representation of Sequence Bloom Trees
Robert S Harris, Paul Medvedev·BioinformaticsPeer-reviewed·Aug 20, 2019
- Scalable sequence database search using Partitioned Aggregated Bloom Comb-Trees
Camille Marchet, Antoine Limasset·BioinformaticsPeer-reviewed·May 25, 2023
- REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets
Camille Marchet, Zamin Iqbal, … Rayan Chikhi·BioinformaticsPeer-reviewed·May 6, 2020
- Mantis: A Fast, Small, and Exact Large-Scale Sequence Search Index
Prashant Pandey, Fatemeh Almodaresi, … Rob Patro·Cell SystemsPeer-reviewed·Jun 21, 2018
- 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