The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
MMseqs software suite for fast and deep clustering and searching of large protein sequence sets
Open accessAbstract
Motivation: Sequence databases are growing fast, challenging existing analysis pipelines. Reducing the redundancy of sequence databases by similarity clustering improves speed and sensitivity of iterative searches. But existing tools cannot efficiently cluster databases of the size of UniProt to 50% maximum pairwise sequence identity or below. Furthermore, in metagenomics experiments typically large fractions of reads cannot be matched to any known sequence anymore because searching with sensitive but relatively slow tools (e.g. BLAST or HMMER3) through comprehensive databases such as UniProt is becoming too costly. Results: MMseqs (Many-against-Many sequence searching) is a software suite for fast and deep clustering and searching of large datasets, such as UniProt, or 6-frame translated metagenomics sequencing reads. MMseqs contains three core modules: a fast and sensitive prefiltering module that sums up the scores of similar k-mers between query and target sequences, an SSE2- and multi-core-parallelized local alignment module, and a clustering module. In our homology detection benchmarks, MMseqs is much more sensitive and 4–30 times faster than UBLAST and RAPsearch, respectively, although it does not reach BLAST sensitivity yet. Using its cascaded clustering workflow, MMseqs can cluster large databases down to ∼30% sequence identity at hundreds of times the speed of BLASTclust and much deeper than CD-HIT and USEARCH. MMseqs can also update a database clustering in linear instead of quadratic time. Its much improved sensitivity-speed trade-off should make MMseqs attractive for a wide range of large-scale sequence analysis tasks. Availability and implementation: MMseqs is open-source software available under GPL at https://github.com/soedinglab/MMseqs Contact: martin.steinegger@mpibpc.mpg.de, soeding@mpibpc.mpg.de Supplementary information: Supplementary data are available at Bioinformatics online.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
KEGG: Kyoto Encyclopedia of Genes and Genomes
Kanehisa, M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.27 · Cited by 37,077
KEGG: Kyoto Encyclopedia of Genes and Genomes
Ogata, H., Goto, S., Sato, K., Fujibuchi, W., Bono, H., & Kanehisa, M. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.1.29 · Cited by 31,232
Search and clustering orders of magnitude faster than BLAST
Edgar, R. C. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq461 · Cited by 20,826
Fast and sensitive protein alignment using DIAMOND
Buchfink, B., Xie, C., & Huson, D. H. (2015) · Nature Methods · doi:10.1038/nmeth.3176 · Cited by 14,201
Structure, function and diversity of the healthy human microbiome
The Human Microbiome Project Consortium (2012) · Nature · doi:10.1038/nature11234 · Cited by 11,726
Cd-hit: Accelerated for clustering the next-generation sequencing data
Fu, L., Niu, B., Zhu, Z., Wu, S., & Li, W. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts565 · Cited by 11,175
UniProt: the Universal Protein knowledgebase
Apweiler, R. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh131 · Cited by 7,498
Murzin, A. G., Brenner, S. E., Hubbard, T., & Chothia, C. (1995) · Journal of Molecular Biology · doi:10.1016/s0022-2836(05)80134-2 · Cited by 6,445
Amino acid substitution matrices from protein blocks.
Henikoff, S., & Henikoff, J. G. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.22.10915 · Cited by 6,218
The Universal Protein Resource (UniProt)
Bairoch, A. (2004) · Nucleic Acids Research · doi:10.1093/nar/gki070 · Cited by 3,774
Structure and function of the global ocean microbiome
Sunagawa, S., Coelho, L. P., Chaffron, S., Kultima, J. R., Labadie, K., Salazar, G., Djahanschiri, B., Zeller, G., Mende, D. R., Alberti, A., et al. (2015) · Science · doi:10.1126/science.1261359 · Cited by 2,921
HHblits: lightning-fast iterative protein sequence searching by HMM-HMM alignment
Remmert, M., Biegert, A., Hauser, A., & Söding, J. (2012) · Nature Methods · doi:10.1038/nmeth.1818 · Cited by 2,288
Self-citationMetagenomic microbial community profiling using unique clade-specific marker genes
Segata, N., Waldron, L., Ballarini, A., Narasimhan, V., Jousson, O., & Huttenhower, C. (2012) · Nature Methods · doi:10.1038/nmeth.2066 · Cited by 1,776
UniRef: comprehensive and non-redundant UniProt reference clusters
Suzek, B. E., Huang, H., McGarvey, P., Mazumder, R., & Wu, C. H. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm098 · Cited by 1,613
Chandonia, J.-M. (2004) · Nucleic Acids Research · doi:10.1093/nar/gkh034 · Cited by 528
Zhao, Y., Tang, H., & Ye, Y. (2012) · Bioinformatics · doi:10.1093/bioinformatics/btr595 · Cited by 418
Striped Smith–Waterman speeds database searches six times over other SIMD implementations
Farrar, M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl582 · Cited by 415
A highly sensitive selection method for directed evolution of homing endonucleases
Chen, Z. (2005) · Nucleic Acids Research · doi:10.1093/nar/gni148 · Cited by 274
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Rognes, T. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-221 · Cited by 206
kClust: fast and sensitive clustering of large protein sequence databases
Hauser, M., Mayer, C., & Söding, J. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-248 · Cited by 102
Self-citationProtein sequence comparison and fold recognition: progress and good-practice benchmarking
Söding, J., & Remmert, M. (2011) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2011.03.005 · Cited by 83
Self-citationLambda: the local aligner for massive biological data
Hauswedell, H., Singer, J., & Reinert, K. (2014) · Bioinformatics · doi:10.1093/bioinformatics/btu439 · Cited by 81
A poor man’s BLASTX—high-throughput metagenomic protein database search using PAUDA
Huson, D., & Xie, C. (2013) · Bioinform. · doi:10.1093/bioinformatics/btt254 · Cited by 71
Sequence clustering strategies improve remote homology recognitions while reducing search times
Li, W., Jaroszewski, L., & Godzik, A. (2002) · Protein Engineering Design and Selection · doi:10.1093/protein/15.8.643 · Cited by 69
RSDB: representative protein sequence databases have high information content
Bhak, J., Holm, L., Heger, A., & Chothia, C. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.5.458 · Cited by 40
Chubb, D., Jefferys, B. R., Sternberg, M. J. E., & Kelley, L. A. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq527 · Cited by 25
PSimScan: Algorithm and Utility for Fast Protein Similarity Search
Kaznadzey, A., Alexandrova, N., Novichkov, V., & Kaznadzey, D. (2013) · PLoS ONE · doi:10.1371/journal.pone.0058505 · Cited by 8
Cited by
Pfam: The protein families database in 2021
Mistry, J., Chuguransky, S., Williams, L., Qureshi, M., Salazar, G. A., Sonnhammer, E. L. L., Tosatto, S. C. E., Paladin, L., Raj, S., Richardson, L. J., et al. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkaa913 · Cited by 7,452
Sensitive protein alignments at tree-of-life scale using DIAMOND
Buchfink, B., Reuter, K., & Drost, H.-G. (2021) · Nature Methods · doi:10.1038/s41592-021-01101-x · Cited by 5,097
MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets
Steinegger, M., & Söding, J. (2017) · Nature Biotechnology · doi:10.1038/nbt.3988 · Cited by 4,840
Self-citationFast and accurate protein structure search with Foldseek
van Kempen, M., Kim, S. S., Tumescheit, C., Mirdita, M., Lee, J., Gilchrist, C. L. M., Söding, J., & Steinegger, M. (2022) · doi:10.1101/2022.02.07.479398 · Cited by 2,598
Self-citationFast and accurate protein structure search with Foldseek
van Kempen, M., Kim, S. S., Tumescheit, C., Mirdita, M., Lee, J., Gilchrist, C. L. M., Söding, J., & Steinegger, M. (2024) · Nature Biotechnology · doi:10.1038/s41587-023-01773-0 · Cited by 2,596
Self-citation
Metadata
- Authors
- Hauser, M., Steinegger, M., & Söding, J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2016-01-06
- Volume
- 32
- Issue
- 9
- Pages
- 1323-1330
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2303521084
- Cited by
- 271
- References
- 29
- FWCI
- 2.86
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.