PT  - JOURNAL ARTICLE
AU  - Mikhail Karasikov
AU  - Harun Mustafa
AU  - Gunnar Rätsch
AU  - André Kahles
TI  - Lossless Indexing with Counting de Bruijn Graphs
AID  - 10.1101/2021.11.09.467907
DP  - 2022 Jan 01
TA  - bioRxiv
PG  - 2021.11.09.467907
4099  - http://biorxiv.org/content/early/2022/02/03/2021.11.09.467907.short
4100  - http://biorxiv.org/content/early/2022/02/03/2021.11.09.467907.full
AB  - Sequencing data is rapidly accumulating in public repositories. Making this resource accessible for interactive analysis at scale requires efficient approaches for its storage and indexing. There have recently been remarkable advances in building compressed representations of annotated (or colored) de Bruijn graphs for efficiently indexing k-mer sets. However, approaches for representing quantitative attributes such as gene expression or genome positions in a general manner have remained underexplored. In this work, we propose Counting de Bruijn graphs (Counting DBGs), a notion generalizing annotated de Bruijn graphs by supplementing each node-label relation with one or many attributes (e.g., a k-mer count or its positions). Counting DBGs index k-mer abundances from 2,652 human RNA-Seq samples in over 8-fold smaller representations compared to state-of-the-art bioinformatics tools and yet faster to construct and query. Furthermore, Counting DBGs with positional annotations losslessly represent entire reads in indexes on average 27% smaller than the input compressed with gzip for human Illumina RNA-Seq and 57% smaller for PacBio HiFi sequencing of viral samples. A complete searchable index of all viral PacBio SMRT reads from NCBI’s SRA (152,884 samples, 875 Gbp) comprises only 178 GB. Finally, on the full RefSeq collection, we generate a lossless and fully queryable index that is 4.4-fold smaller than the MegaBLAST index. The techniques proposed in this work naturally complement existing methods and tools employing de Bruijn graphs and significantly broaden their applicability: from indexing k-mer counts and genome positions to implementing novel sequence alignment algorithms on top of highly compressed graph-based sequence indexes.Competing Interest StatementThe authors have declared no competing interest.