4.7 Article

Ultrafast clustering algorithms for metagenomic sequence analysis

期刊

BRIEFINGS IN BIOINFORMATICS
卷 13, 期 6, 页码 656-668

出版社

OXFORD UNIV PRESS
DOI: 10.1093/bib/bbs035

关键词

clustering; metagenomics; next-generation sequencing; protein families; artificial duplicates; OTU

资金

  1. National Institutes of Health [R01RR025030, R01HG005978]
  2. Gordon and Betty Moore Foundation [CAMERA project]

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

The rapid advances of high-throughput sequencing technologies dramatically prompted metagenomic studies of microbial communities that exist at various environments. Fundamental questions in metagenomics include the identities, composition and dynamics of microbial populations and their functions and interactions. However, the massive quantity and the comprehensive complexity of these sequence data pose tremendous challenges in data analysis. These challenges include but are not limited to ever-increasing computational demand, biased sequence sampling, sequence errors, sequence artifacts and novel sequences. Sequence clustering methods can directly answer many of the fundamental questions by grouping similar sequences into families. In addition, clustering analysis also addresses the challenges in metagenomics. Thus, a large redundant data set can be represented with a small non-redundant set, where each cluster can be represented by a single entry or a consensus. Artifacts can be rapidly detected through clustering. Errors can be identified, filtered or corrected by using consensus from sequences within clusters.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据