Unknown

Dataset Information

Subsampled open-reference clustering creates consistent, comprehensive OTU definitions and scales to billions of sequences.


ABSTRACT: We present a performance-optimized algorithm, subsampled open-reference OTU picking, for assigning marker gene (e.g., 16S rRNA) sequences generated on next-generation sequencing platforms to operational taxonomic units (OTUs) for microbial community analysis. This algorithm provides benefits over de novo OTU picking (clustering can be performed largely in parallel, reducing runtime) and closed-reference OTU picking (all reads are clustered, not only those that match a reference database sequence with high similarity). Because more of our algorithm can be run in parallel relative to "classic" open-reference OTU picking, it makes open-reference OTU picking tractable on massive amplicon sequence data sets (though on smaller data sets, "classic" open-reference OTU clustering is often faster).

SUBMITTER: Rideout JR 

PROVIDER: S-EPMC4145071 | biostudies-literature | 2014

REPOSITORIES: biostudies-literature