henhaobio
Sign in

bioRxivBioinformaticsPreprint

deSAMBA: fast and accurate classification of metagenomics long reads with sparse approximate matches

Gaoyang LiiD, Bo LiuiD, Yadong WangiD

PDFDOICode

Abstract

SummaryLong read sequencing technologies are promising to metagenomics studies. However, there is still lack of read classification tools to fast and accurately identify the taxonomies of noisy long reads, which is a bottleneck to the use of long read sequencing. Herein, we propose deSAMBA, a tailored long read classification approach that uses a novel sparse approximate match block (SAMB)-based pseudo alignment algorithm. Benchmarks on real datasets demonstrate that deSAMBA enables to simultaneously achieve fast speed and good classification yields, which outperforms state-of-the-art tools and has many potentials to cutting-edge metagenomics studies.\n\nAvailability and Implementationhttps://github.com/hitbc/deSAMBA.\n\nSupplementary information:

Citations
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.

Similarity Map
SelectedSame fieldCross-field
THISDas '22Ulrich '24Portik '22Huson '18Depuydt '25Dilthey '19
72% semantic matchBioinformatics
Arun Das, Michael C. Schatz·BMC Bioinformatics·Oct 31, 2022· 4 citations