Clustering huge protein sequence sets in linear time

By Martin Steinegger, Johannes Söding. 2017

848 citations recorded by the source corpus.

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. Billions of metagenomic and genomic sequences fill up public datasets, which makes similarity clustering an important and time-critical analysis step. Here, the authors develop Linclust, an algorithm with linear time complexity that can cluster over a billion sequences within hours on a single server.

Subfields: Artificial Intelligence, Molecular Biology, Algorithms & Complexity, Computational Biology & Bioinformatics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Pushmeet Kohli
  2. Sergey Levine
  3. Zak Costello
  4. Héctor García Martín
  5. Jeffrey A. Ruffolo
  6. Yang Zhang
  7. Chengxin Zhang
  8. Yang Li

In Molecular Biology

  1. Yang Zhang
  2. Robin Pearce
  3. Burkhard Rost
  4. Jinbo Xu
  5. Jianlin Cheng
  6. David T. Jones
  7. Sergey Ovchinnikov
  8. Chengxin Zhang

In Algorithms & Complexity

  1. Héctor García Martín
  2. Zak Costello
  3. Jeffrey A. Ruffolo
  4. Yang Zhang
  5. Chengxin Zhang
  6. Yang Li
  7. Wei Zheng
  8. Milot Mirdita

In Computational Biology & Bioinformatics

  1. Burkhard Rost
  2. Jinbo Xu
  3. Michael Heinzinger
  4. Sergey Ovchinnikov
  5. Yang Zhang
  6. Robin Pearce
  7. Jianlin Cheng
  8. David T. Jones

Citations in the corpus