Linclust

Linclust clusters large-scale metagenomic and protein sequence datasets in linear time to reduce sequence redundancy and enable downstream functional annotation and structure prediction.


Key Features:

  • Linear-Time Complexity: Runtime scales linearly with N (number of sequences) and is independent of K (number of clusters).
  • Memory Efficiency: Can process datasets that are several times larger than available main memory.
  • Speed and Performance: Clustered 1.6 billion metagenomic sequence fragments to a 50% sequence identity threshold in 10 hours on a single server, achieving more than 1000× speedup versus previous methods.

Scientific Applications:

  • Functional annotation and structure prediction: Reduces redundancy to improve functional annotation and protein structure prediction workflows.
  • Protein sequence database curation: Facilitates creation and compression of massive protein sequence databases by similarity-based clustering.
  • Microbial community analysis: Enables large-scale analysis of microbial communities by making metagenomic clustering of billions of fragments computationally tractable.

Methodology:

Linclust's algorithmic design decouples runtime from both the number of sequences and clusters to achieve linear-time complexity for clustering metagenomic sequence fragments.

Topics

Details

License:
GPL-3.0
Maturity:
Mature
Cost:
Free of charge
Tool Type:
command-line tool
Operating Systems:
Linux, Windows, Mac
Programming Languages:
C++
Added:
7/3/2019
Last Updated:
11/24/2024

Operations

Publications

Steinegger M, Söding J. Clustering huge protein sequence sets in linear time. Nature Communications. 2018;9(1). doi:10.1038/s41467-018-04964-5. PMID:29959318. PMCID:PMC6026198.

Documentation

Downloads

Links

Related Tools

MMseqs2
Relation: includedIn