4.6 Article

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

期刊

BMC BIOINFORMATICS
卷 21, 期 1, 页码 -

出版社

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

关键词

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

资金

  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]

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据