JCVI: Ultrafast Clustering Algorithms for Metagenomic Sequence Analysis.
Section Banner



Li W, Fu L, Niu B, Wu S, Wooley J

Ultrafast Clustering Algorithms for Metagenomic Sequence Analysis.

Briefings in Bioinformatics. 2012 Nov 01; 13: 656-68.

External Citation


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.

This publication is listed for reference purposes only. It may be included to present a more complete view of a JCVI employee's body of work, or as a reference to a JCVI sponsored project.