Cited by 2,596Protein Structure and DynamicsEnzyme Structure and FunctionMachine Learning in Bioinformatics

Fast and accurate protein structure search with Foldseek

Open access
van Kempen, Michel, Kim, Stephanie S., Tumescheit, Charlotte, Mirdita, Milot, Lee, Jeongjae, Gilchrist, Cameron L. M., Söding, Johannes, Steinegger, Martin·2024·Nature Biotechnology

Published version of a preprint

Abstract

As structure prediction methods are generating millions of publicly available protein structures, searching these databases is becoming a bottleneck. Foldseek aligns the structure of a query protein against a database by describing tertiary amino acid interactions within proteins as sequences over a structural alphabet. Foldseek decreases computation times by four to five orders of magnitude with 86%, 88% and 133% of the sensitivities of Dali, TM-align and CE, respectively.

AI snapshot

Written from the paper’s full text.

TL;DR

Foldseek encodes protein tertiary interactions as sequences over a 20-state 3Di structural alphabet and searches them with MMseqs2-derived prefilters and alignment modules. It reduces structure-search computation times by four to five orders of magnitude while retaining 86%, 88% and 133% of the sensitivities of Dali, TM-align and CE, respectively.

Key findings

  • Foldseek decreases computation times by four to five orders of magnitude with 86%, 88% and 133% of the sensitivities of Dali, TM-align and CE, respectively.
  • On SCOPe40 all-versus-all searches, Foldseek is more than 4,000 times faster than TM-align and Dali and over 21,000 times faster than CE; on AlphaFoldDB (version 1), it is around 184,600 and 23,000 times faster than Dali and TM-align, respectively.
  • In precision-recall analysis, Foldseek-TM and Foldseek have the highest and third-highest area under the precision-recall curve on family, superfamily and fold levels; Foldseek-TM improves over TM-align because its prefilter suppresses high-scoring false positives.
  • For SARS-CoV-2 RdRp (PDB: 6M71, chain A; 942 residues) searched in AlphaFoldDB (version 1), search times were 10 d for Dali, 33 h for TM-align and 6 s for Foldseek, making it 180,000 and 23,000 times faster; all top 10 hits were known RdRp homologs.

Methods

  • Foldseek discretizes structures into 3Di sequences describing each residue’s geometric conformation with its spatially closest residue, then uses MMseqs2’s double-diagonal k-mer and gapless alignment prefilters followed by SIMD-accelerated Smith–Waterman local alignment combining 3Di and amino acid substitution scores; an optional global TM-align mode is also provided.
  • Benchmarks include SCOPe40 (11,211 non-redundant single-domain structures) all-versus-all, AlphaFoldDB (version 1) clustered to 34,270 structures with 100 randomly selected queries for reference-free multi-domain tests, and HOMSTRAD (1,032 protein families); runtime evaluations used an AMD EPYC 7702P 64-core CPU.
  • Sensitivity was measured as the fraction of true positives before the first false positive, with AUROC/ROC1 and precision-recall analyses; multi-domain benchmarks used LDDT thresholds of at least 0.6 for true positives and below 0.25 for false positives, ignoring matches in between.

Limitations

  • The paper states that the SCOPe benchmark uses only single-domain proteins as queries and targets, so it cannot assess local similarities such as homologous domains shared between multi-domain proteins; the HOMSTRAD alignment benchmark has the same limitation, as most HOMSTRAD proteins are single-domain (median length 182 residues).
  • The paper states that the reference-free multi-domain benchmark requires choosing thresholds for true and false positives.
  • The text makes evident that the 3Di alphabet and substitution matrix were trained and cross-validated on SCOPe40, and that methods likely overfitted on SCOPe due to data leakage were excluded from benchmark comparison; the paper reports no overfitting despite training 492 parameters.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1038/s41587-023-01773-0

Cites

48 of 48 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 22 cited sources checked · 0 supported · 0 flagged

  • Findingown data

    Among 133,813 high-scoring Foldseek false positives in AlphaFoldDB self-search, 1,675 were inspected and revealed queries with multiple structured segments but incorrect relative orientations.

    “We inspected the 1,675 (of 133,813) high-scoring FPs (score per aligned column ≥ 1.0, TM-score < 0.5), revealing queries with multiple structured segments but with incorrect relative orientations (Supplementary Table 3 and Supplementary Fig. 9).”
    Quote in the paperSubstantial claim
  • Findingown data

    In the HOMSTRAD alignment quality benchmark, Foldseek performs slightly below CE, Dali and TM-align.

    “In the reference-based HOMSTRAD alignment quality benchmark24, Foldseek performs slightly below CE, Dali and TM-align (Fig. 2e).”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [24] Mizuguchi, K., Deane, C. M., Blundell, T. L. & Overington, J. P. HOMSTRAD: a database of protein structure alignments for homologous families. Protein Sci. 7, 2469–2471 (1998). source

      Not checked in the free run.

  • Findingown data

    3Di has more evenly distributed state frequencies than traditional backbone structural alphabets.

    “(1) Weaker dependency between consecutive letters and (2) more evenly distributed state frequencies, both enhancing information density and reducing false positives (FPs) (Supplementary Table 1).”
    Quote in the paperSubstantial claim
  • Findingown data

    Foldseek's performance is similar across all six secondary structure classes in SCOPe.

    “Foldseek’s performance is similar across all six secondary structure classes in SCOPe (Supplementary Fig. 5).”
    Quote in the paperNot a substantial claim
  • Findingown data

    3Di has weaker dependency between consecutive letters than traditional backbone structural alphabets.

    “(1) Weaker dependency between consecutive letters and (2) more evenly distributed state frequencies, both enhancing information density and reducing false positives (FPs) (Supplementary Table 1).”
    Quote in the paperSubstantial claim
  • May combine two claims. 22
  • Classified as probably not a substantial claim. 17
  • May combine two claims.

    Findingnone given

    Foldseek decreases computation times by four to five orders of magnitude with 86%, 88% and 133% of the sensitivities of Dali, TM-align and CE, respectively.

    “Foldseek decreases computation times by four to five orders of magnitude with 86%, 88% and 133% of the sensitivities of Dali, TM-align and CE, respectively.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    On the SCOPe40 benchmark set, Foldseek is more than 4,000 times faster than TM-align and Dali and over 21,000 times faster than CE.

    “On this small SCOPe40 benchmark set, Foldseek is more than 4,000 times faster than TM-align and Dali and over 21,000 times faster than CE (Fig. 2c).”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    Foldseek alignments are more accurate and sensitive than MMseqs2, CLE-SW and TM-align, similarly accurate as Dali and 13% less precise but 15% more sensitive than CE.

    “Foldseek alignments are more accurate and sensitive than MMseqs2, CLE-SW and TM-align, similarly accurate as Dali and 13% less precise but 15% more sensitive than CE.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    On AlphaFoldDB (version 1), Foldseek is around 184,600 and 23,000 times faster than Dali and TM-align, respectively.

    “On the much larger AlphaFoldDB (version 1), where Foldseek approaches its full speed, it is around 184,600 and 23,000 times faster than Dali and TM-align, respectively (see below).”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    On the full-length multi-domain AlphaFoldDB benchmark, Foldseek has similar sensitivity as Dali, CE and TM-align and much higher sensitivity than CLE-SW and MMseqs2.

    “Again, Foldseek has similar sensitivity as Dali, CE and TM-align and much higher sensitivity than CLE-SW and MMseqs2.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    In precision-recall analysis, Foldseek-TM and Foldseek have the highest and third-highest area under the precision-recall curve on each of the three levels.

    “In a precision-recall analysis, Foldseek-TM and Foldseek have the highest and third-highest area under the precision-recall curve on each of the three levels (Fig. 2b and Supplementary Fig. 4).”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    Foldseek's sensitivity is below Dali and TM-align, higher than CE and much above 3D-BLAST and CLE-SW.

    “Foldseek’s sensitivity is below Dali and TM-align, higher than the structural aligner CE and much above the structural alphabet-based search tools 3D-BLAST and CLE-SW (Fig. 2a).”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingnone given

    The highest information density in 3Di is encoded in conserved protein cores and the lowest in non-conserved coil/loop regions, whereas the opposite is true for backbone structural alphabets.

    “(3) The highest information density is encoded in conserved protein cores and the lowest in non-conserved coil/loop regions, whereas the opposite is true for backbone structural alphabets.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Findingown data

    Dali's conversion to DAT format produced 11,137 valid structures out of the 11,211 initial structures for the SCOPe benchmark and 34,252 structures out of 34,270 SPICi clusters.

    “The conversion to DAT format produced 11,137 valid structures out of the 11,211 initial structures for the SCOPe benchmark and 34,252 structures out of 34,270 SPICi clusters.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    3D-BLAST produced occasionally high scores (>107) for single residue alignments, so its measurement was excluded from the multi-domain benchmark.

    “We excluded 3D-BLAST’s measurement from the multi-domain benchmark because it produced occasionally high scores (>107) for single residue alignments.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Findingnone given

    Foldseek includes four variants of AlphaFoldDB version 4: UniProt (214 million structures), UniProt50 (54 million structures), Proteome (564,000 structures) and Swiss-Prot (542,000 structures).

    “Currently, we include the four variants of the AlphaFoldDB (version 4): UniProt (214 million structures), UniProt50, a clustered database to 50% sequence identity and 90% bi-directional coverage using MMseqs2 (parameters -c 0.9 --min-seq-id 0.5 --cluster-reassign; 54 million structures), Proteome (564,000 structures) and Swiss-Prot (542,000 structures).”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given

    During batch searches, Foldseek adapts its memory use to the available RAM of the machine.

    “During batch searches, Foldseek adapts its memory use to the available RAM of the machine.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    Foldseek finds around the same number of false positives and true positives with a score of 51 in SCOPe40, so the probability for a hit with score 51 is 50%.

    “For example, Foldseek finds around the same number of FPs and TPs with a score of 51 in SCOPe40. The probability for a hit with score 51 is, therefore, 50%.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    The HOMSTRAD pairwise alignments between the first and last members of each family resulted in structures of a median length of 182 residues.

    “We downloaded the latest HOMSTRAD version (https://mizuguchilab.org/homstrad/data/homstrad_with_PDB_2022_Aug_1.tar.gz) and picked the pairwise alignments between the first and last members of each family, which resulted in structures of a median length of 182 residues.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    In a SARS-CoV-2 RdRp search in AlphaFoldDB, search times were 10 d for Dali, 33 h for TM-align and 6 s for Foldseek, making Foldseek 180,000 and 23,000 times faster.

    “Search times were 10 d for Dali, 33 h for TM-align and 6 s for Foldseek, making it 180,000 and 23,000 times faster.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingnone given

    The 3Di alphabet developed for Foldseek describes tertiary residue-residue interactions instead of backbone conformations and proved critical for reaching high sensitivities.

    “The 3Di alphabet developed for Foldseek describes tertiary residue–residue interactions instead of backbone conformations and proved critical for reaching high sensitivities.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    One query in the multi-domain benchmark was excluded because it ran over 16 days.

    “For the multi-domain benchmark, we excluded one query that was running over 16 d.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    The SCOPe benchmark set consists of single domains with an average length of 174 residues.

    “The SCOPe benchmark set consists of single domains with an average length of 174 residues.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Findingnone given

    The AlphaFoldDB/UniProt50 (version 4), AlphaFoldDB/Proteome (version 4), AlphaFoldDB/Swiss-Prot (version 4), CATH50, ESM Atlas High-Quality Clu30 and PDB100 require 191 GB, 3.8 GB, 3.4 GB, 1.4 GB, 110 GB and 2.0 GB RAM, respectively.

    “The AlpaFoldDB/UniProt50 (version 4), AlphaFoldDB/Proteome (version 4), AlphaFoldDB/Swiss-Prot (version 4), CATH50, ESM Atlas High-Quality Clu30 and PDB100 require 191 GB, 3.8 GB, 3.4 GB, 1.4 GB, 110 GB and 2.0 GB RAM, respectively.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    Foldseek's Needleman-Wunsch implementation does not compute exactly the same alignment as TM-align because it applies affine gap costs, whereas TM-align does not.

    “Our NW implementation does not compute exactly the same alignment because we apply affine gap costs, whereas TM-align does not (Supplementary Fig. 12).”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingreasoning

    By not restricting itself to exact matches, Foldseek's prefilter achieves high sensitivity while reducing the number of sequences for which full alignments are computed by several orders of magnitude.

    “By not restricting itself to exact matches, the prefilter achieves high sensitivity while reducing the number of sequences for which full alignments are computed by several orders of magnitude.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    SPICi produced 34,270 clusters from the all-against-all BLAST search of AlphaFoldDB version 1.

    “SPICi produced 34,270 clusters from the search result.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim.

    Premisecitation

    The European Bioinformatics Institute holds over 214 million structures predicted by AlphaFold2.

    “The European Bioinformatics Institute already holds over 214 million structures predicted by AlphaFold2 (ref. 3)”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [3] Varadi, M. et al. AlphaFold Protein Structure Database: massively expanding the structural coverage of protein–sequence space with high-accuracy models. Nucleic Acids Res. 50, D439–D444 (2022). source

      Not checked in the free run.

  • May combine two claims.

    Premisecitation

    Sequence searching is four to five orders of magnitude faster: an all-versus-all comparison of 100 million sequences would take MMseqs2 only around a week on the same cluster.

    “Sequence searching is four to five orders of magnitude faster: an all-versus-all comparison of 100 million sequences would take MMseqs2 (ref. 6) only around a week on the same cluster.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [6] Steinegger, M. & Söding, J. MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets. Nat. Biotechnol. 35, 1026–1028 (2017). source

      Not checked in the free run.

  • May combine two claims.

    Premisecitation

    Searching with a single query structure through a database with 100 million protein structures would take TM-align a month on one CPU core, and an all-versus-all comparison would take 10 millennia on a 1,000-core cluster.

    “Searching with a single query structure through a database with 100 million protein structures would take the popular TM-align11 tool a month on one CPU core, and an all-versus-all comparison would take 10 millennia on a 1,000-core cluster.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [11] Zhang, Y. & Skolnick, J. TM-align: a protein structure alignment algorithm based on the TM-score. Nucleic Acids Res. 33, 2302–2309 (2005). source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    The ESM Atlas contains over 617 million metagenomic structures predicted by ESMFold.

    “the ESM Atlas contains over 617 million metagenomic structures predicted by ESMFold4.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [4] Lin, Z. et al. Evolutionary-scale prediction of atomic-level protein structure with a language model. Science 379, 1123–1130 (2023). source

      Not checked in the free run.

  • May combine two claims.

    Interpretationown data

    3Di's weaker dependency and more evenly distributed state frequencies enhance information density and reduce false positives.

    “(1) Weaker dependency between consecutive letters and (2) more evenly distributed state frequencies, both enhancing information density and reducing false positives (FPs) (Supplementary Table 1).”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    Most structural alphabets, such as CLE, 3D-BLAST and Protein Blocks, discretize the conformations of short stretches of usually 3-5 Cα atoms.

    “Most, such as CLE, 3D-BLAST and Protein Blocks, discretize the conformations of short stretches of usually 3–5 Cα atoms17–19.”
    Quote in the paperNot a substantial claim0 of 3 sources checked
    • cites [17] Wang, S. & Zheng, W.-M. CLePAPS: fast pair alignment of protein structures based on conformational letters. J. Bioinform. Comput. Biol. 6, 347–366 (2008). source

      Not checked in the free run.

    • cites [18] Yang, J.-M. & Tung, C.-H. Protein structure database search and evolutionary classification. Nucleic Acids Res. 34, 3646–3659 (2006). source

      Not checked in the free run.

    • cites [19] de Brevern, A. G., Etchebest, C. & Hazout, S. Bayesian probabilistic approach for predicting backbone structures in terms of protein blocks. Proteins 41, 271–287 (2000). source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    Databases are only required to remain resident in RAM if Foldseek is used as a webserver.

    “Databases are only required to remain resident in RAM if Foldseek is used as a webserver.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationown data

    3D aligners such as TM-align may overlook homologous structures that are not globally superposable, whereas Foldseek and Dali are independent of relative domain orientations and excel at detecting homologous multi-domain structures.

    “This illustrates that 3D aligners such as TM-align may overlook homologous structures that are not globally superposable, whereas Foldseek (as well as the two-dimensional (2D) aligner Dali) is independent of relative domain orientations and excels at detecting homologous multi-domain structures12.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [12] Hasegawa, H. & Holm, L. Advances and pitfalls of protein structural alignment. Curr. Opin. Struct. Biol. 19, 341–348 (2009). source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationnone given

    A drawback of the reference-free multi-domain benchmark is the need to choose thresholds for true positives and false positives.

    “A drawback of our reference-free multi-domain benchmark is the need to choose thresholds for TPs and FPs (Supplementary Fig. 6).”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Premisenone given

    Geometricus is a representative of alignment-free tools, which are fast but can find only globally similar structures.

    “We included Geometricus20 in the SCOPe benchmark as a representative of alignment-free tools, which are fast but can find only globally similar structures.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [20] Durairaj, J., Akdel, M., de Ridder, D. & van Dijk, A. D. J. Geometricus represents protein structures as shape-mers derived from moment invariants. Bioinformatics 36, i718–i725 (2020). source

      Not checked in the free run.

  • May combine two claims.

    Interpretationown data

    The virtual center preferably selects long-range, tertiary interactions and only falls back to selecting interactions to i + 1 or i − 1 when no other residues are nearby.

    “This virtual center preferably selects long-range, tertiary interactions and only falls back to selecting interactions to i + 1 or i − 1 when no other residues are nearby.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    Measuring sensitivity up to the 1st false positive (ROC1) better reflects the requirements for low false discovery rates in automatic searches than measuring up to the 5th false positive.

    “We measure the sensitivity up to the 1st FP (ROC1) instead, for example, up to the 5th FP, because ROC1 better reflects the requirements for low false discovery rates in automatic searches.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationcitation

    Weighting true positive, false positive and false negative counts by the reciprocal of their family, superfamily or fold size makes folds, superfamilies and families contribute linearly with their size instead of quadratically.

    “All counts (TP, FP and FN) were weighted by the reciprocal of their family, superfamily or fold size. In this way, folds, superfamilies and families contribute linearly with their size instead of quadratically36.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [36] Eddy, S. R. Accelerated profile HMM searches. PLoS Comput. Biol. 7, e1002195 (2011). source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    The Foldseek webserver is based on the MMseqs2 webserver.

    “The Foldseek webserver is based on the MMseqs2 webserver43.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [43] Mirdita, M., Steinegger, M. & Söding, J. MMseqs2 desktop and local web server app for fast, interactive sequence searches. Bioinformatics 35, 2856–2858 (2019). source

      Not checked in the free run.

36 of 36
  • The paper relies on this without support.

    The SCOPe40 dataset is a suitable benchmark for evaluating protein structure search sensitivity.

    “The SCOPe benchmark set consists of single domains with an average length of 174 residues.”
  • The paper relies on this without support.

    The HOMSTRAD pairwise alignments are accurate reference alignments for measuring alignment quality.

    “With the HOMSTRAD alignments as reference, we measured for each pairwise alignment the sensitivity (fraction of residue pairs of the HOMSTRAD alignment that were correctly aligned) and the precision (fraction of correctly aligned residue pairs in the predicted alignment).”
  • The paper relies on this without support.

    The ESM Atlas API can accurately predict structures of user-supplied sequences up to 400 residues.

    “We use the ESM Atlas API to predict structures of user-supplied sequences that are, at most, 400 residues long.”
  • The paper relies on this without support.

    The virtual center parameters optimized on SCOPe generalize to other datasets.

    “The virtual center defined by θ = 270∘, τ = 0∘ and l = 2 performed best in the SCOPe benchmark.”
4 of 4

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Foldseek increases the speed of structural comparisons by four to five orders of magnitude relative to previous approaches while maintaining sensitivity.

    “Foldseek can increase the speed of comparisons of structures by four to five orders of magnitudes relative to previous approaches while maintaining sensitivity15”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

  • Same-family hits are both included as TPs and ignored

    Minor

    A hit within the same family is also within the same superfamily, so the stated TP and ignored categories overlap.

  • Conflicting descriptions of the E-value network's input composition

    Minor

    The main text says the network uses 3Di sequence composition, whereas Methods says it uses amino acid composition. These are different inputs for the same predicted distribution parameters.

2 of 2

Cites

Flagged first, then by citations

Research works printed but not linked: 1

  1. Van den Oord, A., Vinyals, O. & Kavukcuoglu, K. Neural discrete representation learning. Proc. of the 31st Conference on Neural Information Processing Systems. https://proceedings.neurips.cc/paper_files/paper/2017/file/7a98af17e63a0ac09ce2e96d03992fbc-Paper.pdf (NIPS, 2017).

Cited by

Sorted by citations

Authors
van Kempen, M., Kim, S. S., Tumescheit, C., Mirdita, M., Lee, J., Gilchrist, C. L. M., Söding, J., & Steinegger, M.
Affiliations
  • Seoul National University (KR)
  • Max Planck Institute for Multidisciplinary Sciences (DE)
Corresponding author
  • Söding, Johannes
  • Steinegger, Martin
Venue
Nature Biotechnology
Published
2023-05-08
Volume
42
Issue
2
Pages
243-246
ISSN
  • 0733-222X (ISSN-L)
  • 1087-0156
  • 1546-1696
OpenAlex
W4375858802
Cited by
2,596
References
48
Citations by year
2026: 828 · 2025: 917 · 2024: 592 · 2023: 211 · 2022: 44 · 2012: 2
FWCI
227.22
Type
journal article
Language
en
Open access
Locations
  • Nature Biotechnology (publishedVersion, cc-by)
  • bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • MPG.PuRe (Max Planck Society) (submittedVersion, other-oa)
  • GoeScholar The Publication Server of the Georg-August-Universität Göttingen (Georg-August-Universität Göttingen) (submittedVersion, cc-by)
  • Seoul National University Open Repository (Seoul National University) (submittedVersion)
Funders
  • National Research Foundation of Korea (2019R1-A6A1-A10073437, 2019R1A6A1A10073437, 2020M3A9G7103933, 2021R1C1C102065, 2021M3A9I4021220)
  • German ministry for education and research (BMBF)
  • Samsung DS research fund, Creative-Pioneering Researchers Program through Seoul National University
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Physical Sciences › Materials Science › Materials Chemistry › Enzyme Structure and Function
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
Keywords
protein structure search, Foldseek, structural alignment, structural alphabet, protein structure database, computational efficiency
MeSH terms
Algorithms, Amino Acids, Proteins, Software, Databases, Protein

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.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-10.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-10.

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