Back

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

Li, G.; Liu, B.; Wang, Y.

2019-08-18 bioinformatics
10.1101/736777 bioRxiv
Show 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:

Matching journals

The top 3 journals account for 50% of the predicted probability mass.

50% of probability mass above

"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.