4.6 Article

CDKAM: a taxonomic classification tool using discriminative k-mers and approximate matching strategies

Journal

BMC BIOINFORMATICS
Volume 21, Issue 1, Pages -

Publisher

BMC
DOI: 10.1186/s12859-020-03777-y

Keywords

Third generation sequencing; Taxonomic classification; Discriminative k-mer; Approximate matching

Funding

  1. Cross-Institute Research Fund of Shanghai Jiao Tong University [YG2017ZD01]
  2. National Natural Science Foundation of China [61472246]
  3. National Basic Research Program of China [2013CB956103]

Ask authors/readers for more resources

Background Current taxonomic classification tools use exact string matching algorithms that are effective to tackle the data from the next generation sequencing technology. However, the unique error patterns in the third generation sequencing (TGS) technologies could reduce the accuracy of these programs. Results We developed a Classification tool using Discriminative K-mers and Approximate Matching algorithm (CDKAM). This approximate matching method was used for searching k-mers, which included two phases, a quick mapping phase and a dynamic programming phase. Simulated datasets as well as real TGS datasets have been tested to compare the performance of CDKAM with existing methods. We showed that CDKAM performed better in many aspects, especially when classifying TGS data with average length 1000-1500 bases. Conclusions CDKAM is an effective program with higher accuracy and lower memory requirement for TGS metagenome sequence classification. It produces a high species-level accuracy.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available