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

• Published in: PeerJ (San Francisco, CA) Vol. 2; no. e545; p. e545
• Main Authors: Rideout, Jai Ram, He, Yan, Navas-Molina, Jose A, Walters, William A, Ursell, Luke K, Gibbons, Sean M, Chase, John, McDonald, Daniel, Gonzalez, Antonio, Robbins-Pianka, Adam, Clemente, Jose C, Gilbert, Jack A, Huse, Susan M, Zhou, Hong-Wei, Knight, Rob, Caporaso, J Gregory
• Format: Journal Article
• Language: English
• Published: United States PeerJ. Ltd 21.08.2014; PeerJ, Inc; PeerJ Inc
• Subjects: Algorithms; Analysis; Bioinformatics; Datasets; Ecology; Genomics; Laboratories; Methods; Microbial ecology; Microbiology; Microbiome; OTU picking; Phylogenetics; Qiime; RNA; rRNA 16S; Taxonomy; Microbial ecology; Bioinformatics; OTU picking; Microbiome; Qiime
• ISSN: 2167-8359; 2167-8359
• DOI: 10.7717/peerj.545

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). We illustrate that here by applying it to the first 15,000 samples sequenced for the Earth Microbiome Project (1.3 billion V4 16S rRNA amplicons). To the best of our knowledge, this is the largest OTU picking run ever performed, and we estimate that our new algorithm runs in less than 1/5 the time than would be required of "classic" open reference OTU picking. We show that subsampled open-reference OTU picking yields results that are highly correlated with those generated by "classic" open-reference OTU picking through comparisons on three well-studied datasets. An implementation of this algorithm is provided in the popular QIIME software package, which uses uclust for read clustering. All analyses were performed using QIIME's uclust wrappers, though we provide details (aided by the open-source code in our GitHub repository) that will allow implementation of subsampled open-reference OTU picking independently of QIIME (e.g., in a compiled programming language, where runtimes should be further reduced). Our analyses should generalize to other implementations of these OTU picking algorithms. Finally, we present a comparison of parameter settings in QIIME's OTU picking workflows and make recommendations on settings for these free parameters to optimize runtime without reducing the quality of the results. These optimized parameters can vastly decrease the runtime of uclust-based OTU picking in QIIME.