Genestrip: exact and efficient read classification for selected groups of organisms

BACKGROUND: The consumption of main memory resources is a significant burden in k-mer-based metagenomic analysis when creating related databases but also when performing (unique) k-mer-counting and read classification. Genestrip addresses this issue by focusing on small but freely configurable groups of organisms. Regarding the selected organisms, Genestrip produces k-mer databases and results comparable to those of KrakenUniq but at a fraction of its required memory resources. Our tool ensures that during database generation, the most suitable lowest common ancestor taxon is assigned for each stored k-mer by also considering genomes of organisms whose k-mers are not included in the database. This enables read analysis with high precision and recall for the organisms of interest. RESULTS: We assess the correctness, usefulness and performance of Genestrip in different contexts and show that it indeed ascertains high quality read classifications for organisms whose genomes are included in a corresponding database. Our example databases comprise millions to a few billions of k-mers covering a dozen to a few thousands of species and lend themselves to usage in tick surveillance, medical diagnostics or agriculture. All databases were generated on a regular PC within hours, and related analysis performance was competitive to highly favorable. The deliberate focus on a particular set of genera or species allows for more genomes to be included from related organisms while the resulting databases remain small. Since k-mer compression becomes unnecessary, false positives emerging from related information loss are entirely avoided. We exemplify that such small but deep databases tend to improve recall during read classification while sustaining high precision. CONCLUSIONS: Due to Genestrip's particular way of updating the k-mers' lowest common ancestor taxa, both database creation and fastq file analysis can be realized with little memory and with favorable runtimes as well as high classification quality. So both, database creation and read classification may be performed even on regular PCs. Genestrip's qualities empower users to flexibly design, build and use small k-mer databases for their own needs with potentially deep genomic coverage.

Authors

Institutions

Publication Details

Journal
BMC Bioinformatics
Published
2026-06-16
DOI
https://doi.org/10.1186/s12859-026-06512-1
Primary Topic
Genomics and Phylogenetic Studies
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Genestrip: exact and efficient read classification for selected groups of organisms

Daniel Pfeifer, Clas Rurik, Markus Graf
BMC Bioinformatics
Genomics and Phylogenetic Studies
article

Genestrip: exact and efficient read classification for selected groups of organisms

Daniel Pfeifer, Clas Rurik, Markus Graf
article en

Abstract

BACKGROUND: The consumption of main memory resources is a significant burden in k-mer-based metagenomic analysis when creating related databases but also when performing (unique) k-mer-counting and read classification. Genestrip addresses this issue by focusing on small but freely configurable groups of organisms. Regarding the selected organisms, Genestrip produces k-mer databases and results comparable to those of KrakenUniq but at a fraction of its required memory resources. Our tool ensures that during database generation, the most suitable lowest common ancestor taxon is assigned for each stored k-mer by also considering genomes of organisms whose k-mers are not included in the database. This enables read analysis with high precision and recall for the organisms of interest. RESULTS: We assess the correctness, usefulness and performance of Genestrip in different contexts and show that it indeed ascertains high quality read classifications for organisms whose genomes are included in a corresponding database. Our example databases comprise millions to a few billions of k-mers covering a dozen to a few thousands of species and lend themselves to usage in tick surveillance, medical diagnostics or agriculture. All databases were generated on a regular PC within hours, and related analysis performance was competitive to highly favorable. The deliberate focus on a particular set of genera or species allows for more genomes to be included from related organisms while the resulting databases remain small. Since k-mer compression becomes unnecessary, false positives emerging from related information loss are entirely avoided. We exemplify that such small but deep databases tend to improve recall during read classification while sustaining high precision. CONCLUSIONS: Due to Genestrip's particular way of updating the k-mers' lowest common ancestor taxa, both database creation and fastq file analysis can be realized with little memory and with favorable runtimes as well as high classification quality. So both, database creation and read classification may be performed even on regular PCs. Genestrip's qualities empower users to flexibly design, build and use small k-mer databases for their own needs with potentially deep genomic coverage.

BMC BioinformaticsVol. 27(1)
Heilbronn University (DE)
Zero hunger
Openalex Percentile: Top 12%
Genomics and Phylogenetic Studies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.