PreprintCited by 9Protein Structure and DynamicsMachine Learning in BioinformaticsEnzyme Structure and Function

Ultrafast end-to-end protein structure prediction enables high-throughput exploration of uncharacterised proteins

Open access
Kandathil, Shaun M, Greener, Joe G, Lau, Andy M, Jones, David T·2020·bioRxiv (Cold Spring Harbor Laboratory)

Abstract

Deep learning-based prediction of protein structure usually begins by constructing a multiple sequence alignment (MSA) containing homologues of the target protein. The most successful approaches combine large feature sets derived from MSAs, and considerable computational effort is spent deriving these input features. We present a method that greatly reduces the amount of preprocessing required for a target MSA, while producing main chain coordinates as a direct output of a deep neural network. The network makes use of just three recurrent networks and a stack of residual convolutional layers, making the predictor very fast to run, and easy to install and use. Our approach constructs a directly learned representation of the sequences in an MSA, starting from a one-hot encoding of the sequences. When supplemented with an approximate precision matrix, the learned representation can be used to produce structural models of comparable or greater accuracy as compared to our original DMPfold method, while requiring less than a second to produce a typical model. This level of accuracy and speed allows very large-scale 3-D modelling of proteins on minimal hardware, and we demonstrate that by producing models for over 1.3 million uncharacterized regions of proteins extracted from the BFD sequence clusters. After constructing an initial set of approximate models, we select a confident subset of over 30,000 models for further refinement and analysis, revealing putative novel protein folds. We also provide updated models for over 5,000 Pfam families studied in the original DMPfold paper. Significance Statement: We present a deep learning-based predictor of protein tertiary structure that uses only a multiple sequence alignment (MSA) as input. To date, most emphasis has been on the accuracy of such deep learning methods, but here we show that accurate structure prediction is also possible in very short timeframes (a few hundred milliseconds). In our method, the backbone coordinates of the target protein are output directly from the neural network, which makes the predictor extremely fast. As a demonstration, we generated over 1.3 million models of uncharacterised proteins in the BFD, a large sequence database including many metagenomic sequences. Our results showcase the utility of ultrafast and accurate tertiary structure prediction in rapidly exploring the “dark space” of proteins.

AI snapshot

Written from the paper’s full text.

TL;DR

DMPfold2 is an ultrafast end-to-end deep learning protein structure predictor that takes an MSA and directly outputs backbone coordinates, achieving comparable or better accuracy than DMPfold1 while running in under a second for typical models. It was applied at scale to over 1.3 million BFD subsequences, yielding 33,548 confident models and 23,495 CATH superfamily assignments, plus updated Pfam models.

Key findings

  • On 39 CASP13 FM and FM/TBM domains, DMPfold2 folded 30 domains to TM-score ≥ 0.5 versus 26 for DMPfold1, with mean TM-score 0.590 versus 0.531.
  • For 5,193 Pfam families, approximately 60% of models had confidence ≥ 0.4; among 255 families with new PDB annotations, DMPfold2 outperformed DMPfold1 in all difficulty classes and outperformed C-I-TASSER in hard and very hard categories but underperformed in trivial and easy cases.
  • From 1,333,242 BFD subsequences, 48,625 models (3.65%) were single- or double-helix structures; of the remaining 1,284,617, 33,548 (2.61%) had confidence ≥ 0.4, and 23,495 models were assigned to 2,394 CATH superfamilies.
  • For 33,548 modelled BFD sequences, HHsearch found significant PDB70 hits for only 12% at E-value 0.001, while 83% had a model matching a PDB structure, illustrating the value of tertiary models for template detection.

Methods

  • DMPfold2 embeds an MSA using two vertical GRU layers followed by two bidirectional GRU layers, combines the embedding with a fast_dca precision matrix, processes it through 16 residual blocks, and outputs Cα coordinates via multidimensional scaling plus a learnable MDS module and coordinate refinement.
  • Training used 31,159 CATH V4.2 s35 domains and 6,742 full-length chains, with 300 chains held out for validation; CASP13 evaluation used 39 FM or FM/TBM domains.
  • BFD modelling extracted 1,333,242 MSAs from consensus sequences unmatched to Pfam or CATH-Gene3D HMMs and at least 30 residues long, ran one DMPfold2 iteration, filtered single/double helices, applied a confidence cutoff of 0.4, and compared models to PDB/CATH using TM-align.

Limitations

  • The paper states that DMPfold2 does not explicitly use template information, which likely explains lower performance on easy and trivial targets versus C-I-TASSER; it also notes that RNNs poorly model dependencies beyond a few hundred time steps.
  • The paper states that most low-confidence BFD models correspond to very short sequences and/or MSAs with few sequences, and that some domain boundaries may not have been correctly parsed because filtering used only sequence profile HMM similarity.
  • The paper states that no atom-level optimisation or refinement was attempted in the reported results, and that training iterations were limited to 0–5 due to accumulated gradients and GPU memory; evident from the text, the 0.4 confidence cutoff is permissive and “novel folds” remain putative.

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

Integrity signals

Registry

Crossref · 10.1101/2020.11.27.401232

Cites

54 of 54 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

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

  • Findingown data

    DMPfold2 produces structural models of comparable or greater accuracy than DMPfold1.

    “When supplemented with an approximate precision matrix, the learned representation can be used to produce structural models of comparable or greater accuracy as compared to our original DMPfold method, while requiring less than a second to produce a typical model.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [9] source

      Not checked in the free run.

  • Findingown data

    DMPfold2 generated over 1.3 million models of uncharacterised proteins in the BFD.

    “we generated over 1.3 million models of uncharacterised proteins in the BFD”
    Quote in the paperSubstantial claim
  • Findingreasoning

    Accurate structure prediction is possible in very short timeframes (a few hundred milliseconds).

    “we show that accurate structure prediction is also possible in very short timeframes (a few hundred milliseconds).”
    Quote in the paperSubstantial claim
  • Findingreasoning

    During training with a rigid body coordinate loss, the final network is able to learn to automatically transform the output coordinates for any structures mirrored by the multidimensional scaling process, without manual intervention.

    “During training with a rigid body coordinate loss, as opposed to a distance-based loss, this final network is able to learn to automatically transform the output coordinates for any structures mirrored by the multidimensional scaling process, without manual intervention.”
    Quote in the paperSubstantial claim
  • Findingown data

    DMPfold2 requires less than a second to produce a typical model.

    “while requiring less than a second to produce a typical model”
    Quote in the paperSubstantial claim
  • The quote only partly states this claim. 1
  • Classified as probably not a substantial claim. 14
  • May combine two claims. 15
  • The quote only partly states this claim.

    Findingown data

    DMPfold2 was used to produce models for over 1.3 million uncharacterized regions of proteins extracted from the BFD sequence clusters.

    “we demonstrate that by producing models for over 1.3 million uncharacterized regions of proteins extracted from the BFD sequence clusters”
    Quote in the paperSubstantial claim
  • Classified as probably not a substantial claim.

    Findingnone given

    A confident subset of over 30,000 models was selected for further refinement and analysis.

    “we select a confident subset of over 30,000 models for further refinement and analysis”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    DMPfold2 obtains predictions of comparable or better accuracy than DMPfold1 while taking under a second to a few minutes to produce one structure on readily-available hardware.

    “We show that despite the relatively simple composition of the input feature set, we are able to obtain predictions of comparable or better accuracy than DMPfold (9), while taking under a second to a few minutes to produce one structure on readily-available hardware.”
    Quote in the paperSubstantial claim0 of 1 sources checked
    • cites [9] source

      Not checked in the free run.

  • May combine two claims.

    Findingown data

    DMPfold2 was applied to over 1.3 million subsequences without detectable templates extracted from the BFD, generating over 30,000 confident models.

    “we apply it to over 1.3 million subsequences without detectable templates extracted from the BFD, generating over 30,000 confident models”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingown data

    Of the 1,333,242 models, 48,625 models (3.65%) corresponded to single-or double-helix structures.

    “Of the 1,333,242 models, 48,625 models (3.65%) corresponded to single-or double-helix structures.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    Iterative updates to the coordinates output by DMPfold2 result in improved confidence scores and greater secondary structure content, regardless of the MSA used.

    “The results in Figures S3 demonstrate that regardless of the MSA used, the iterative updates to the coordinates output by DMPfold2 result in improved confidence scores, as well as greater secondary structure content.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    Most of the low-confidence BFD models correspond to target sequences that are either very short, and/or whose MSAs have very few sequences.

    “most of these low-confidence models correspond to target sequences that are either very short, and/or whose MSAs have very few sequences (Figure S2).”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Findingnone given

    225 models with a variety of predicted confidence scores were taken from the initial set of 1.3M models.

    “225 models with a variety of predicted confidence scores were taken from the initial set of 1.3M models.”
    Quote in the paperNot a substantial claim
  • Classified as probably not a substantial claim.

    Findingreasoning

    The set of 1,333,242 MSAs from BFD was used as inputs for modelling runs.

    “The resulting set of 1,333,242 MSAs were used as the inputs for the modelling runs.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingown data

    The mean TM-score is 0.590 for DMPfold2 and 0.531 for DMPfold1 on CASP13 domains.

    “The mean TM-score is 0.590 for DMPfold2 and 0.531 for DMPfold1.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Findingreasoning

    DMPfold2 outperforms C-I-TASSER in the hard and very hard categories, but underperforms in trivial and easy cases.

    “DMPfold2 further outperforms C-I-TASSER in the hard and very hard categories, but underperforms in trivial and easy cases.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Findingown data

    The majority of the 33,548 selected BFD targets are predicted to be ordered according to IUPred, with 79% of sequences having 80% or more residues predicted as ordered.

    “The majority of these targets are also predicted to be ordered according to IUPred, with 79% of sequences having 80% or more residues predicted as ordered.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationown data

    DMPfold2 outputs backbone atom coordinates directly from the neural network and provides a predicted confidence for the output coordinates.

    “Our method produces coordinates of backbone atoms as a direct output of the neural network model, further saving time over model generation approaches used previously, and also provides a predicted confidence in the output coordinates.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data

    DMPfold2 greatly reduces the amount of preprocessing required for a target MSA while producing main chain coordinates as a direct output of a deep neural network.

    “We present a method that greatly reduces the amount of preprocessing required for a target MSA, while producing main chain coordinates as a direct output of a deep neural network.”
    Quote in the paperSubstantial claim
    • Rests on an assumption: Precomputing features derived from an MSA can be time-consuming and can sometimes take longer than the rest of the prediction pipeline combined.
    • Rests on an assumption: A model trained on derived features is limited to using the information available in those handpicked features.
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    The MSA Transformer derives embeddings via a tied row attention framework that exploits the equivalence of aligned positions in the MSA.

    “In the MSA Transformer (16), the neural network model exploits the equivalence of aligned positions in the MSA in order to derive embeddings via a tied row attention framework.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [16] R. Rao , et al., Msa transformer. bioRxiv (2021). source

      Not checked in the free run.

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

    Premisecitation

    End-to-end differentiable coordinate generation for protein structures was first demonstrated in the Recurrent Geometric Network.

    “The process of end-to-end differentiable coordinate generation for protein structures, where atomic coordinates are produced as a direct output of a neural network, was first demonstrated in the Recurrent Geometric Network (18)”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [18] 2019, End-to-End Differentiable Learning of Protein Structure, Cell Syst source

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationnone given

    No study has attempted to leverage the BFD collection to derive structural annotations for the protein families represented therein.

    “To our knowledge, no study has attempted to leverage this collection of sequences to derive structural annotations for the protein families represented therein.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationown data

    The approach can be used to find remote homologues and aid in function prediction, along with finding a number of novel folds.

    “We show how such an approach can be used to find remote homologues and aid in function prediction, along with finding a number of novel folds.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    AlphaFold2 employs a number of novel neural network modules specialised for producing representations of MSAs and protein structures, beginning from a direct embedding of the input MSA and target sequence.

    “AlphaFold2 (48) employs a number of novel neural network modules that are specialised for producing representations of MSAs and protein structures, beginning from a direct embedding of the input MSA and target sequence.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [48] J. Jumper , et al., Highly accurate protein structure prediction with AlphaFold. Nature (2021) https:/doi.org/10.1038/s41586-021-03819-2.

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationreasoning

    Allowing the network to access all the information in a raw MSA, rather than just pairwise frequency information, enables it to extract richer information that can be used for more accurate prediction of structural features.

    “It is expected that allowing the network to access all the information in a raw MSA, rather than just pairwise frequency information, for example, enables it to extract richer information that can be used for more accurate prediction of structural features.”
    Quote in the paperNot a substantial claim
  • Probably not a substantial claim: may not pass S4 (based). May combine two claims.

    Premisenone given

    Most published end-to-end methods have not been able to produce models comparable to the state-of-the-art in de novo prediction, mainly because they have not effectively exploited covariation data as inputs.

    “So far, however, most published end-to-end methods have not been able to produce models comparable to the state-of-the-art in de novo prediction, mainly because they have not effectively exploited covariation data as inputs.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationreasoning

    Direct MSA embedding methods make de novo protein structure prediction methods far more efficient and easier to use.

    “At the very least, these direct MSA embedding methods make de novo protein structure prediction methods far more efficient and easier to use.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Study design and conductnone given

    A model confidence threshold of ≥ 0.4 was applied to isolate BFD models likely to be correct.

    “A confidence threshold of ≥ 0.4 was applied to isolate models likely to be correct.”
    Quote in the paperNot a substantial claim
  • May combine two claims.

    Interpretationreasoning

    Although DMPfold2's models are not as accurate as those of other methods, they are of sufficient accuracy to allow easy identification of potentially interesting targets from very large datasets that can then be modelled using slower and more accurate tools.

    “Although DMPfold2's models are not as accurate, they are still of sufficient accuracy to allow for easy identification of potentially interesting targets from very large datasets that can then be modelled using slower and more accurate modelling tools.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Premisecitation

    The RoseTTAFold method employs direct embeddings of MSAs to produce distance restraints as well as to produce coordinates directly.

    “The RoseTTAFold method employs direct embeddings of MSAs to produce distance restraints, as well as to produce coordinates directly (17).”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [17] M. Baek , F. DiMaio , I. Anishchenko , J. Dauparas , Accurate prediction of protein structures and interactions using a 3-track network. bioRxiv (2021). source

      Not checked in the free run.

  • Classified as probably not a substantial claim.

    Study design and conductnone given

    The representative PDBs of the 255 Pfam families did not overlap with the DMPfold2 training set.

    “It is also important to note that the representative PDBs of the 255 families did not overlap with the DMPfold2 training set.”
    Quote in the paperSubstantial claim
  • May combine two claims.

    Interpretationown data

    A TM-align search against the PDB reveals that the DMPfold2 models are structurally similar to existing PDB entries, whereas an HMM-HMM comparison would miss these templates.

    “This illustrates the value of tertiary structure models in retrieving structural templates: assuming that the DMPfold2 models are correct at the fold level, the TM-align search against the PDB reveals that these models are structurally similar to existing PDB entries, whereas an HMM-HMM comparison would miss these templates.”
    Quote in the paperSubstantial claim
    • The authors state this as an assumption: The DMPfold2 models are correct at the fold level.
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation

    The principle that tertiary structure models aid structural template retrieval has long been understood and is the basis of protein threading.

    “Of course, this principle has been well understood for some time, and is the basis of protein threading (45,46), but the ease and speed with which a rough candidate model can be generated for a query sequence has the potential to accelerate and improve the sensitivity of structural template searches.”
    Quote in the paperNot a substantial claim0 of 2 sources checked
    • cites [45] source

      Not checked in the free run.

    • cites [46] source

      Not checked in the free run.

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

    Precomputing features derived from an MSA can be time-consuming and can sometimes take longer than the rest of the prediction pipeline combined.

    “This approach, though effective, requires that these features be precomputed, which can in some cases be a time-consuming process and can sometimes take longer than the rest of the prediction pipeline combined.”
  • The paper relies on this without support.

    A model trained on derived features is limited to using the information available in those handpicked features.

    “as a model trained on derived features is limited to using the information available in those handpicked features.”
  • The paper relies on this without support.

    An MSA for a target sequence can have arbitrarily many sequences in it.

    “A key difficulty in using MSAs directly as input to a neural network is the fact that an MSA for a target sequence can have arbitrarily many sequences in it.”
  • The paper relies on this without support.

    Existing efforts to model large sets of protein sequences have been limited by the computational cost of running more than a few thousand predictions in a reasonable time frame.

    “These efforts have been limited, though, by the computational cost of running more than a few thousand predictions in a reasonable time frame.”
  • The paper relies on this without support.

    The computational cost has prevented structural annotations from keeping pace with the vast increase in sequence data now available as a result of metagenomic sequencing efforts.

    “This has prevented structural annotations from keeping pace with the vast increase in sequence data now available as a result of metagenomic sequencing efforts.”
  • The paper relies on this without support.

    Experimental structures have been made available for 255 of the Pfam families since the last DMPfold publication.

    “Experimental structures have since been made available for 255 of these families.”
  • The authors state this as an assumption.

    The DMPfold2 models are correct at the fold level.

    “assuming that the DMPfold2 models are correct at the fold level, the TM-align search against the PDB reveals that these models are structurally similar to existing PDB entries, whereas an HMM-HMM comparison would miss these templates.”
7 of 7

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?

  • The atom-atom contact energy AACE is used to score and rank all poses, as this has been shown to provide better results than shape-complementarity alone.

    “The atom-atom contact energy AACE18 is used to score and rank all poses, as this has been shown to provide better results than shape-complementarity alone54.”

    From Improved prediction of protein-protein interactions using AlphaFold2 (2021) · cites this paper as [18]

    The Introduction discusses predicting inter-residue contacts, and §2.4.2 describes ranking structural matches by TM-score. Neither addresses AACE, docking-pose ranking, or a comparison with shape complementarity. Searches for those terms in our copy found no supporting passage; page numbers were not available. (LLM, conf=0.76)

    Experimental — accuracy not yet measured

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.

  • MSA embedding is given two different widths

    Minor

    The architecture first describes the output feature map as 256 values per position, then describes the final per-column embeddings as 2 × 256 values per position.

1 of 1

Cites

Flagged first, then by citations

3 of the 57 references couldn’t be matched to a known paper.

Research works printed but not linked: 3

  1. S. M. Kandathil , J. G. Greener , A. M. Lau , D. T. Jones , Deep learning-based prediction of protein structure using learned representations of multiple sequence alignments. bioRxiv, 2020.11.27.401232 (2020).
  2. I. Goodfellow , D. Warde-Farley , M. Mirza , A. Courville , Y. Bengio , Maxout Networks in Proceedings of the 30th International Conference on Machine Learning, Proceedings of Machine Learning Research., S. Dasgupta , D. McAllester , Eds. (PMLR, 2013), pp. 1319–1327.
  3. A. Vaswani , et al., Attention Is All You Need. arXiv [cs.CL] (2017).

Cited by

Sorted by citations

Authors
Kandathil, S. M., Greener, J. G., Lau, A. M., & Jones, D. T.
Affiliations
University College London (GB)
Corresponding author
Jones, David T
Venue
bioRxiv (Cold Spring Harbor Laboratory)
Publisher
openRxiv
Published
2020-11-27
OpenAlex
W3186814059
Cited by
8
References
57
Citations by year
2023: 1 · 2022: 3 · 2021: 4
Type
posted content
Language
en
Open access
Licence
cc-by
Locations
bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion, cc-by)
Funders
H2020 European Research Council (695558)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Protein Structure and Dynamics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Machine Learning in Bioinformatics
  • Physical Sciences › Materials Science › Materials Chemistry › Enzyme Structure and Function
Keywords
protein structure prediction, multiple sequence alignment, recurrent neural networks, hypothetical protein, novel protein fold, Pfam families

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