Clustering huge protein sequence sets in linear time
Citations Over TimeTop 1% of 2018 papers
Abstract
Metagenomic datasets contain billions of protein sequences that could greatly enhance large-scale functional annotation and structure prediction. Utilizing this enormous resource would require reducing its redundancy by similarity clustering. However, clustering hundreds of millions of sequences is impractical using current algorithms because their runtimes scale as the input set size N times the number of clusters K, which is typically of similar order as N, resulting in runtimes that increase almost quadratically with N. We developed Linclust, the first clustering algorithm whose runtime scales as N, independent of K. It can also cluster datasets several times larger than the available main memory. We cluster 1.6 billion metagenomic sequence fragments in 10 h on a single server to 50% sequence identity, >1000 times faster than has been possible before. Linclust will help to unlock the great wealth contained in metagenomic and genomic sequence databases.
Related Papers
- Metagenomics and Its Applications in Agriculture, Biomedicine and Environmental Studies(2011)
- → Simulating metagenomic stable isotope probing datasets with MetaSIPSim(2020)22 cited
- → Simulating metagenomic stable isotope probing datasets with MetaSIPSim(2019)4 cited
- New Application of Metagenomics and Metatranscriptomics in Environmental Microbial Research(2014)
- → Reference-free resolving of long-read metagenomic data(2018)