deSPI: efficient classification of metagenomic reads with lightweight de Bruijn graph-based reference indexing

preprint OA: closed
📄 Open PDF View at publisher

Abstract

Summary In metagenomic studies, fast and effective tools are on wide demand to implement taxonomy classification for upto billions of reads. Herein, we propose deSPI, a novel read classification method that classifies reads by recognizing and analyzing the matches between reads and reference with de Bruijn graph-based lightweight reference indexing. deSPI has faster speed with relatively small memory footprint, meanwhile, it can also achieve higher or similar sensitivity and accuracy. Availability the C++ source code of deSPI is available at https://github.com/hitbc/deSPI Contact [email protected] Supplementary information Supplementary data are available at Bioinformatics online.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00