Ultrafast end-to-end protein structure prediction enables high-throughput exploration of uncharacterised proteins
Open accessAbstract
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
Cites
Statistics
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
- Findingnone given
Updated models were provided for over 5,000 Pfam families studied in the original DMPfold paper.
“We also provide updated models for over 5,000 Pfam families studied in the original DMPfold paper.”
Quote in the paperNot a substantial claim - Findingown data
Models were generated for 5,193 of the 5,214 Pfam families using DMPfold2 and the same alignments as DMPfold1.
“Models were generated for 5,193 of these families, using DMPfold2 and the same alignments as those used for DMPfold1.”
Quote in the paperSubstantial claim - Findingown data
A number of confident BFD models do not match structures in the PDB.
“we do find a number of confident models that do not match structures in the PDB”
Quote in the paperSubstantial claim - Findingown data
Three DMPfold2 models match CATH superfamilies that are the only superfamily in the respective CATH topology type.
“Three examples are shown in Figure 4b of models that match CATH superfamilies that are the only superfamily in the respective CATH topology type.”
Quote in the paperNot a substantial claim - Findingown data
1,333,242 models were generated from the BFD alignments by running one iteration of DMPfold2.
“In total, we generated 1,333,242 models from the BFD alignments by running one iteration of DMPfold2.”
Quote in the paperSubstantial claim - Findingnone given
The best performance is obtained when using the learned MSA representation alongside an on-the-fly computed precision matrix.
“Although the best performance is obtained when using the learned MSA representation alongside an on-the-fly computed precision matrix, the work in this study opens up the possibility of using just the MSA representation itself as the sole input to the ResNet for predicting protein structure”
Quote in the paperNot a substantial claim - Findingown data
From the remaining 1,284,617 models, 33,548 (2.61%) had a network-predicted confidence score of 0.4 or greater.
“Next, from the remaining 1,284,617 models, 33,548 (2.61%) were found to have a network-predicted confidence score of 0.4 or greater.”
Quote in the paperNot a substantial claim - Findingown data
The vast majority of the 1.3 million BFD models are predicted to have a confidence score of less than 0.4.
“Although the vast majority of the models are predicted to have a confidence score of less than 0.4”
Quote in the paperNot a substantial claim - Findingown data
Embedding whole MSAs into a linear representation using standard language modelling approaches can enable the efficient generation of 3-D structures directly from sequence data.
“Overall, we have demonstrated that the idea of embedding whole MSAs into a linear representation using standard language modelling approaches can enable the efficient generation of 3-D structures directly from sequence data.”
Quote in the paperSubstantial claim - Findingown data
It is possible to directly process an MSA into a learned representation that is effective for predicting structural features in proteins.
“Here, we show that it is possible to directly process a MSA into a learned representation that is effective for predicting structural features in proteins.”
Quote in the paperSubstantial claim - Findingown data
A number of targets were identified as having a potentially novel fold, based on comparison to the PDB with TM-align.
“A number of targets were identified as having a potentially novel fold, based on comparison to the PDB with TM-align.”
Quote in the paperNot a substantial claim - Findingown data
Around 86% of the modelled BFD subsequences were fewer than 300 residues in length.
“Given that around 86% of these subsequences were fewer than 300 residues in length”
Quote in the paperSubstantial claim - Findingown data
Approximately 60% of the generated Pfam models were at a confidence score of 0.4 or greater.
“Approximately 60% of the models generated were at a confidence score of 0.4 or greater”
Quote in the paperNot a substantial claim - Findingown data
A larger fraction of the iteratively refined models are found to have a hit to the PDB with a TM-score of 0.5 or greater.
“Concomitantly, a larger fraction of the models are found to have a hit to the PDB with a TM-score of 0.5 or greater.”
Quote in the paperSubstantial claim - Findingown data
Of the 33,548 modelled BFD sequences used as HHsearch queries against PDB70, 31% have at least one hit at an E-value threshold of 1.0.
“We used the BFD sub-MSAs for the 33,548 modelled sequences as queries to search the PDB70 database using HHsearch.31% have at least one hit in the PDB70 database at an E-value threshold of 1.0.”
Quote in the paperSubstantial claim - Findingown data
DMPfold2 produces more accurate structure models for CASP13 FM and FM/TBM domains than DMPfold1.
“Comparison against models generated using DMPfold1 (Figure 2 and Table S1) shows that DMPfold2 produces more accurate structure models for these domains.”
Quote in the paperSubstantial claim - Findingnone given
In DMPfold2, the use of two gated recurrent networks to embed the input MSA is effective.
“In DMPfold2, the use of two gated recurrent networks to embed the input MSA is clearly effective, but was something of a design compromise in that RNNs are relatively fast to train, but have known limitations in terms of the limits of modelling long-range dependencies in sequences.”
Quote in the paperNot a substantial claim - Findingown data
83% of the BFD queries have a DMPfold2 model that matches a structure in the PDB.
“At an E-value threshold of 0.001, only 12% of the queries retrieve significant hits despite 83% having a model that matches a structure in the PDB.”
Quote in the paperSubstantial claim - Findingown data
DMPfold2 outperforms DMPfold1 in all difficulty classes in terms of mean TM-score for the 255 Pfam families.
“From our analysis, it can be seen that DMPfold2 outperforms DMPfold1 in all difficulty classes, in terms of the mean TM-score achieved for each category (Figure 2c).”
Quote in the paperSubstantial claim - Findingreasoning
Structural models built using DMPfold2 are more accurate on average than those from DMPfold1.
“Structural models built using DMPfold2 are more accurate on average than those from DMPfold1.”
- Also stated in: § 4. Discussion · plain
“Overall, DMPfold2 end-to-end achieves comparable or greater model accuracy than DMPfold1.”
Quote in the paperSubstantial claim - Also stated in: § 4. Discussion · plain
- Findingown data
23,495 BFD models were assigned to 2,394 CATH superfamilies on the basis of structural similarity.
“Overall, we were able to assign 23,495 models to 2,394 CATH superfamilies on the basis of structural similarity (Table S2)”
Quote in the paperSubstantial claim - Findingown data
Five CASP13 domains could be folded correctly (TM-score > 0.5) by the end-to-end procedure but not by DMPfold1.
“Five CASP13 domains could be folded correctly (TM-score > 0.5) by the end-to-end procedure but not by DMPfold1.”
Quote in the paperNot a substantial claim - Findingown data
Applying DMPfold2 to sequence families from the BFD, even with a relatively coarse-grained approach, predicted structures with plausible topologies for tens of thousands of uncharacterised protein domains, including some with potentially novel folds.
“We showcased this approach by applying DMPfold2 to sequence families from the BFD, and even using a relatively coarse-grained approach, we were able to predict structures with plausible topologies for tens of thousands of uncharacterised protein domains, including some with potentially novel folds.”
Quote in the paperSubstantial claim - Findingown data
At an E-value threshold of 0.001, only 12% of the BFD queries retrieve significant hits in PDB70.
“At an E-value threshold of 0.001, only 12% of the queries retrieve significant hits despite 83% having a model that matches a structure in the PDB.”
Quote in the paperSubstantial claim - Findingnone given
The DMPfold2 modelling process can be used to identify fold-level similarity to existing PDB entries where such similarity would otherwise have been missed by a purely sequence-based comparison.
“We also showed that the modelling process can be used to identify fold-level similarity to existing PDB entries, where such similarity would otherwise have been missed by a purely sequence-based comparison.”
Quote in the paperSubstantial claim - Findingown data
DMPfold2 is able to fold 30 CASP13 domains to a TM-score of 0.5 or greater, as compared to 26 for DMPfold1.
“DMPfold2 is able to fold 30 domains to a TM-score of 0.5 or greater, as compared to 26 for DMPfold1.”
Quote in the paperSubstantial claim - Findingown data
DMPfold2 produces models in much less time than RoseTTAFold and AlphaFold2.
“In comparison to these methods, DMPfold2 produces models in much less time (Figure S5), making it suitable for use at a very large scale.”
Quote in the paperSubstantial claim - Interpretationown data
The selected models revealed putative novel protein folds.
“revealing putative novel protein folds”
Quote in the paperSubstantial claim - Premisecitation
Covarying residues in proteins are frequently found to be close together in the tertiary structure.
“Analysis of amino acid residue covariation in deep multiple sequence alignments (MSAs) has revealed that covarying residues in proteins are frequently found to be close together in the tertiary structure.”
Quote in the paperSubstantial claim0 of 3 sources checked - Premisecitation
Iteration of the prediction process can make significant improvements in model quality.
“As we first showed with DMPfold1 (9), iteration of the prediction process, where the final model is fed back in as an input to the network, can make significant improvements in model quality.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [9] source
Not checked in the free run.
- Premisecitation
A system of recurrent neural network (RNN) layers can be used to process MSAs of arbitrary size.
“Recently, we demonstrated that a system of recurrent neural network (RNN) layers can be used to process MSAs of arbitrary size (15).”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [15] 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).
Not checked in the free run.
- Interpretationreasoning
DMPfold2 is fast enough to run at unprecedented scale.
“DMPfold2 is thus fast enough to run at unprecedented scale”
Quote in the paperSubstantial claim- Rests on an assumption: 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.
- Interpretationreasoning
For MSAs with longer sequences or with many more homologous sequences, even gated RNNs will start to become ineffective.
“For MSAs with longer sequences or with many more homologous sequences, even gated RNNs will start to become ineffective.”
Quote in the paperSubstantial claim - Interpretationown data
The large fraction of models with a similar structure in the PDB despite most sequences with templates being eliminated shows the value in de novo protein structure prediction for mapping sequences to the existing fold space and inferring homology.
“The large fraction of models with a similar structure in the PDB despite most sequences with templates being eliminated shows the value in de novo protein structure prediction for mapping sequences to the existing fold space and inferring homology.”
Quote in the paperSubstantial claim - Interpretationreasoning
Most of the modelled BFD subsequences correspond to single domains.
“most will correspond to single domains”
Quote in the paperSubstantial claim - Interpretationown data
These confident BFD models likely represent novel folds.
“and likely represent novel folds”
Quote in the paperSubstantial claim - Interpretationreasoning
The lower performance of DMPfold2 on easy and trivial targets can be attributed to the fact that DMPfold2 does not make explicit use of template information, whereas C-I-TASSER does.
“The lower performance of our method on easy and trivial targets can be attributed to the fact that DMPfold2 does not make explicit use of template information, whereas C-I-TASSER does.”
Quote in the paperNot a substantial claim - Interpretationown data
Tertiary structure models are valuable for retrieving structural 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.
- Premisenone given
In practice, gated RNNs model dependencies beyond a window of a few hundred time steps poorly.
“In theory, gated RNNs are able to avoid the problems of vanishing gradients when modelling long sequences, but in practice, dependencies beyond a window of a few hundred time steps are poorly modelled.”
Quote in the paperSubstantial claim - Premisecitation
It is possible to speculate about the function of modelled sequences by matching the model to structures of known function.
“In some cases it is possible to speculate about the function of modelled sequences by matching the model to structures of known function (47).”
Quote in the paperSubstantial claim0 of 1 sources checked- cites [47] source
Not checked in the free run.
- Interpretationreasoning
This approach enables structural models to be built on a far larger scale than was previously possible.
“This approach enables structural models to be built on a far larger scale than was previously possible.”
Quote in the paperSubstantial claim - Interpretationreasoning
For the modelled sequences matched to a CATH superfamily that is the only superfamily in its topology type, it is likely that the sequences share a function with other members of the matched superfamily.
“In these cases it is likely that the sequences share a function with other members of the matched superfamily.”
Quote in the paperSubstantial claim - Interpretationreasoning
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.
“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 paperSubstantial claim - Interpretationreasoning
For some fraction of the BFD targets, domain boundaries may not have been correctly parsed, as the subsequence filtering procedures were based only on sequence profile HMM similarity.
“Additionally, for some fraction of these targets, domain boundaries may not have been correctly parsed, as our subsequence filtering procedures were based only on sequence profile HMM similarity.”
Quote in the paperNot a substantial claim - Interpretationown data
Model quality can usually be improved by generating a fresh MSA for the subsequence of interest, rather than merely extracting a region of the original BFD MSA for a longer sequence family.
“These results show the benefit of iterative structure refinement, but also demonstrate that model quality can usually be improved by generating a fresh MSA for the subsequence of interest, rather than merely extracting a region of the original BFD MSA for a longer sequence family.”
Quote in the paperNot a substantial claim - Premisecitation
Most targets in the FM category at CASP do match a known fold, even though the template is not found with sequence-based searching.
“Indeed most targets in the FM category at CASP do match a known fold, even though the template is not found with sequence-based searching (44).”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites [44] 2019, CASP13 target classification into tertiary structure prediction categories, Proteins source
Not checked in the free run.
- Interpretationown data
The assignment of 23,495 models to CATH superfamilies suggests that the predictions are correct at the fold level.
“suggesting that the predictions are correct at the fold level.”
Quote in the paperSubstantial claim - Interpretationreasoning
Confidence values are output per residue, which allows confidently modelled segments of the model to be distinguished from less confidently modelled segments.
“Confidence values are output per residue, which allows confidently modelled segments of the model to be distinguished from less confidently modelled segments.”
Quote in the paperNot a substantial 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 dataDMPfold2 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 claimClassified as probably not a substantial claim.
Findingnone givenA 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 claimMay combine two claims.
Findingown dataDMPfold2 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 dataDMPfold2 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 claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingown dataOf 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 claimMay combine two claims.
Findingown dataIterative 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 claimMay combine two claims.
Findingown dataMost 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 claimProbably not a substantial claim: may not pass S3 (load-bearing).
Findingnone given225 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 claimClassified as probably not a substantial claim.
FindingreasoningThe 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 claimMay combine two claims.
Findingown dataThe 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 claimMay combine two claims.
FindingreasoningDMPfold2 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 claimMay combine two claims.
Findingown dataThe 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 claimMay combine two claims.
Interpretationown dataDMPfold2 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 claimMay combine two claims.
Interpretationown dataDMPfold2 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).
PremisecitationThe 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).
PremisecitationEnd-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 givenNo 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 claimMay combine two claims.
Interpretationown dataThe 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 claimProbably not a substantial claim: may not pass S3 (load-bearing).
PremisecitationAlphaFold2 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).
InterpretationreasoningAllowing 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 claimProbably not a substantial claim: may not pass S4 (based). May combine two claims.
Premisenone givenMost 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 claimMay combine two claims.
InterpretationreasoningDirect 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 claimProbably not a substantial claim: may not pass S3 (load-bearing).
Study design and conductnone givenA 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 claimMay combine two claims.
InterpretationreasoningAlthough 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 claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
PremisecitationThe 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 givenThe 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 claimMay combine two claims.
Interpretationown dataA 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).
PremisecitationThe 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
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.”
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
MinorThe 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.
“We used a system of gated recurrent unit (GRU) layers to process and embed the input MSA, and output a feature map with 256 x L values, where L is the length of the target sequence.”
“The per-column representations are then passed to another stack of 2 bidirectional GRU layers with 256 hidden units, producing final embeddings for each column of 2 x 256 values.”
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946 · see citing works
Highly accurate protein structure prediction with AlphaFold
Jumper, J., Evans, R., Pritzel, A., Green, T., Figurnov, M., Ronneberger, O., Tunyasuvunakool, K., Bates, R., Žídek, A., Potapenko, A., et al. (2021) · Nature · doi:10.1038/s41586-021-03819-2 · Cited by 43,764 · see citing works
Squeeze-and-Excitation Networks
Hu, J., Shen, L., & Sun, G. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00745 · Cited by 35,667 · see citing works
PyTorch: An Imperative Style, High-Performance Deep Learning Library
Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.01703 · Cited by 31,473 · see citing works
Kabsch, W., & Sander, C. (1983) · Biopolymers · doi:10.1002/bip.360221211 · Cited by 15,320 · see citing works
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 · see citing works
Accelerated Profile HMM Searches
Eddy, S. R. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002195 · Cited by 6,975 · see citing works
Accurate prediction of protein structures and interactions using a 3-track network
Baek, M., DiMaio, F., Anishchenko, I., Dauparas, J., Ovchinnikov, S., Lee, G. R., Wang, J., Cong, Q., Kinch, L. N., Schaeffer, R. D., et al. (2021) · doi:10.1101/2021.06.14.448402 · Cited by 5,542 · see citing works
TM-align: a protein structure alignment algorithm based on the TM-score
Zhang, Y. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki524 · Cited by 3,774 · see citing works
The HHpred interactive server for protein homology detection and structure prediction
Söding, J., Biegert, A., & Lupas, A. N. (2005) · Nucleic Acids Research · doi:10.1093/nar/gki408 · Cited by 3,703 · see citing works
Improved protein structure prediction using potentials from deep learning
Senior, A. W., Evans, R., Jumper, J., Kirkpatrick, J., Sifre, L., Green, T., Qin, C., Žídek, A., Nelson, A. W. R., Bridgland, A., et al. (2020) · Nature · doi:10.1038/s41586-019-1923-7 · Cited by 3,378 · see citing works
Self-citationRives, A., Meier, J., Sercu, T., Goyal, S., Lin, Z., Liu, J., Guo, D., Ott, M., Zitnick, C. L., Ma, J., et al. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2016239118 · Cited by 3,286 · see citing works
Rives, A., Meier, J., Sercu, T., Goyal, S., Lin, Z., Liu, J., Guo, D., Ott, M., Zitnick, C. L., Ma, J., et al. (2019) · doi:10.1101/622803 · Cited by 3,280 · see citing works
A Method to Identify Protein Sequences That Fold into a Known Three-Dimensional Structure
Bowie, J. U., Lüthy, R., & Eisenberg, D. (1991) · Science · doi:10.1126/science.1853201 · Cited by 2,851 · see citing works
Scoring function for automated assessment of protein structure template quality
Zhang, Y., & Skolnick, J. (2004) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.20264 · Cited by 2,392 · see citing works
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 · see citing works
Dosztányi, Z., Csizmók, V., Tompa, P., & Simon, I. (2005) · Computer applications in the biosciences · doi:10.1093/bioinformatics/bti541 · Cited by 1,943 · see citing works
Morcos, F., Pagnani, A., Lunt, B., Bertolino, A., Marks, D. S., Sander, C., Zecchina, R., Onuchic, J. N., Hwa, T., & Weigt, M. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1111471108 · Cited by 1,434 · see citing works
Improved protein structure prediction using predicted interresidue orientations
Yang, J., Anishchenko, I., Park, H., Peng, Z., Ovchinnikov, S., & Baker, D. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1914677117 · Cited by 1,421 · see citing works
Efficient transformers: A survey
Tay, Y., Dehghani, M., Bahri, D., & Metzler, D. (2023) · ACM Computing Surveys · doi:10.1145/3530811 · Cited by 1,267 · see citing works
A new approach to protein fold recognition
Jones, D. T., Taylort, W. R., & Thornton, J. M. (1992) · Nature · doi:10.1038/358086a0 · Cited by 1,221 · see citing works
Self-citationUnified rational protein engineering with sequence-based deep representation learning
Alley, E. C., Khimulya, G., Biswas, S., AlQuraishi, M., & Church, G. M. (2019) · Nature Methods · doi:10.1038/s41592-019-0598-1 · Cited by 1,131 · cited 1× · see citing works
“Standard transformer models have already been used to embed unaligned protein sequences [39–41], but the most efficient transformer models released in the last year are now capable of handling sequence lengths even in the millions, and so this suggests that a single deep transformer model with a compressed self-atte…”
MethodAccurate De Novo Prediction of Protein Contact Map by Ultra-Deep Learning Model
Wang, S., Sun, S., Li, Z., Zhang, R., & Xu, J. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005324 · Cited by 931 · see citing works
Clustering huge protein sequence sets in linear time
Steinegger, M., & Söding, J. (2018) · Nature Communications · doi:10.1038/s41467-018-04964-5 · Cited by 875 · see citing works
Discussion of a Set of Points in Terms of their Mutual Distances
Young, G., & Householder, A. S. (1938) · Psychometrika · doi:10.1007/bf02287916 · Cited by 773 · see citing works
Taylor, W. R., & Orengo, C. A. (1989) · Journal of Molecular Biology · doi:10.1016/0022-2836(89)90084-3 · Cited by 667 · see citing works
Improved contact prediction in proteins: using pseudolikelihoods to infer Potts models
Ekeberg, M., Lövkvist, C., Lan, Y., Weigt, M., & Aurell, E. (2013) · Physical Review E · doi:10.1103/physreve.87.012707 · Cited by 661 · see citing works
Zheng, W. H., Zhang, C., Li, Y., Pearce, R., Bell, E. W., & Zhang, Y. (2021) · Cell Reports Methods · doi:10.1016/j.crmeth.2021.100014 · Cited by 574 · see citing works
Protein structure determination using metagenome sequence data
Ovchinnikov, S., Park, H., Varghese, N., Huang, P.-S., Pavlopoulos, G. A., Kim, D. E., Kamisetty, H., Kyrpides, N. C., & Baker, D. (2017) · Science · doi:10.1126/science.aah4043 · Cited by 520 · see citing works
CATH: increased structural coverage of functional space
Sillitoe, I., Bordin, N., Dawson, N., Waman, V. P., Ashford, P., Scholes, H. M., Pang, C. S. M., Woodridge, L., Rauer, C., Sen, N., et al. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkaa1079 · Cited by 509 · see citing works
Protein-level assembly increases protein sequence recovery from metagenomic samples manyfold
Steinegger, M., Mirdita, M., & Söding, J. (2019) · Nature Methods · doi:10.1038/s41592-019-0437-4 · Cited by 445 · see citing works
ProtTrans: Towards Cracking the Language of Life’s Code Through Self-Supervised LearningPreprint
Elnaggar, A., Heinzinger, M., Dallago, C., Rehawi, G., Wang, Y., Jones, L., Gibbs, T., Feher, T., Angerer, C., Steinegger, M., et al. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.07.12.199554 · Cited by 409 · see citing works
Distance-based protein folding powered by deep learning
Xu, J. (2019) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1821309116 · Cited by 401 · see citing works
End-to-End Differentiable Learning of Protein Structure
AlQuraishi, M. (2019) · Cell Systems · doi:10.1016/j.cels.2019.03.006 · Cited by 371 · see citing works
Rao, R., Liu, J., Verkuil, R., Meier, J., Canny, J. F., Abbeel, P., Sercu, T., & Rives, A. (2021) · doi:10.1101/2021.02.12.430858 · Cited by 350 · see citing works
[36] SSAP: Sequential structure alignment program for protein structure comparison
Orengo, C. A., & Taylor, W. R. (1996) · Methods in enzymology on CD-ROM/Methods in enzymology · doi:10.1016/s0076-6879(96)66038-8 · Cited by 336 · see citing works
Learning generative models for protein fold families
Balakrishnan, S., Kamisetty, H., Carbonell, J. G., Lee, S., & Langmead, C. J. (2011) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22934 · Cited by 316 · see citing works
Prediction of protein disorder based on IUPred
Dosztányi, Z. (2017) · Protein Science · doi:10.1002/pro.3334 · Cited by 225 · see citing works
Gene3D: Extensive prediction of globular domains in proteins
Lewis, T. E., Sillitoe, I., Dawson, N., Lam, S., Clarke, T., Lee, D. A., Orengo, C., & Lees, J. (2017) · Nucleic Acids Res. · doi:10.1093/nar/gkx1069 · Cited by 195 · see citing works
Greener, J. G., Kandathil, S. M., & Jones, D. T. (2019) · Nature Communications · doi:10.1038/s41467-019-11994-0 · Cited by 178 · see citing works
Self-citationPrediction of interresidue contacts with DeepMetaPSICOV in CASP13
Kandathil, S. M., Greener, J. G., & Jones, D. T. (2019) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.25779 · Cited by 107 · see citing works
Self-citationrawMSA: End-to-end Deep Learning using raw Multiple Sequence Alignments
Mirabello, C., & Wallner, B. (2019) · PLOS ONE · doi:10.1371/journal.pone.0220182 · Cited by 105 · see citing works
Li, Y., Zhang, C., Bell, E. W., Yu, D., & Zhang, Y. (2019) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25798 · Cited by 94 · see citing works
(2018) · International Conference on Learning Representations · Cited by 92 · see citing works
Environmental conditions shape the nature of a minimal bacterial genome
Antczak, M., Michaelis, M., & Wass, M. N. (2019) · Nature Communications · doi:10.1038/s41467-019-10837-2 · Cited by 55 · see citing works
Kukić, P., Mirabello, C., Tradigo, G., Walsh, I., Veltri, P., & Pollastri, G. (2014) · BMC Bioinformatics · doi:10.1186/1471-2105-15-6 · Cited by 49 · see citing works
Secondary structure formation in model polypeptide chains
Aszódi, A., & Taylor, W. R. (1994) · Protein Engineering Design and Selection · doi:10.1093/protein/7.5.633 · Cited by 44 · see citing works
Large-scale structure prediction by improved contact predictions and model quality assessment
Michel, M., Hurtado, D. M., Uziela, K., & Elofsson, A. (2017) · Bioinformatics · doi:10.1093/bioinformatics/btx239 · Cited by 41 · see citing works
A fully open-source framework for deep learning protein real-valued distances
Adhikari, B. (2020) · Scientific Reports · doi:10.1038/s41598-020-70181-0 · Cited by 40 · see citing works
CASP13 target classification into tertiary structure prediction categories
Kinch, L. N., Kryshtafovych, A., Monastyrskyy, B., & Grishin, N. V. (2019) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.25775 · Cited by 36 · see citing works
DeepDist: real-value inter-residue distance prediction with deep residual convolutional networkPreprint
Wu, T., Guo, Z., Hou, J., & Cheng, J. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.03.17.995910 · Cited by 25 · see citing works
PconsFam: An Interactive Database of Structure Predictions of Pfam Families
Lamb, J., Jarmolinska, A. I., Michel, M., Hurtado, D. M., Sulkowska, J. I., & Elofsson, A. (2019) · Journal of Molecular Biology · doi:10.1016/j.jmb.2019.01.047 · Cited by 15 · see citing works
BioStructures.jl: read, write and manipulate macromolecular structures in Julia
Greener, J. G., Selvaraj, J., & Ward, B. J. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btaa502 · Cited by 14 · see citing works
Self-citationNear-complete protein structural modelling of the minimal genomePreprint
Greener, J. G., Desai, N., Kandathil, S. M., & Jones, D. T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.06623 · Cited by 2 · see citing works
Self-citation
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
- 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).
- 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.
- A. Vaswani , et al., Attention Is All You Need. arXiv [cs.CL] (2017).
Cited by
Sorted by citations
Improved prediction of protein-protein interactions using AlphaFold2
Bryant, P., Pozzati, G., & Elofsson, A. (2021) · doi:10.1101/2021.09.15.460468 · Cited by 1,025 · see citing works
Single-sequence protein structure prediction using language models from deep learning
Chowdhury, R., Bouatta, N., Biswas, S., Rochereau, C., Church, G. M., Sorger, P. K., & AlQuraishi, M. (2021) · doi:10.1101/2021.08.02.454840 · Cited by 455 · see citing works
“We have previously described an end-to-end differentiable, ML-based recurrent geometric network (hereafter RGN1) 22 that predicts protein structure from position-specific scoring matrices (PSSMs) derived from MSAs; related end-to-end approaches have since been reported 23–25 .”
BackgroundSingle-sequence protein structure prediction using a language model and deep learning
Chowdhury, R., Bouatta, N., Biswas, S., Floristean, C., Kharkar, A., Roy, K., Rochereau, C., Ahdritz, G., Zhang, J., Church, G. M., et al. (2022) · Nature Biotechnology · doi:10.1038/s41587-022-01432-w · Cited by 455 · see citing works
Rao, R., Liu, J., Verkuil, R., Meier, J., Canny, J. F., Abbeel, P., Sercu, T., & Rives, A. (2021) · doi:10.1101/2021.02.12.430858 · Cited by 350 · see citing works
Structure-based protein design with deep learning
Ovchinnikov, S., & Huang, P.-S. (2021) · Current Opinion in Chemical Biology · doi:10.1016/j.cbpa.2021.08.004 · Cited by 93 · see citing works
Protein sequence‐to‐structure learning: Is this the end(‐to‐end revolution)?
Laine, E., Eismann, S., Elofsson, A., & Grudinin, S. (2021) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.26235 · Cited by 44 · see citing works
“The most recent version of DMPfold2 (DPMfold2-new in Table 1 [50]) attempted to resolve this issue by adding an extra-GRU layer.”
BackgroundMethodInfluentialUsing AlphaFold for Rapid and Accurate Fixed Backbone Protein Design
Moffat, L., Greener, J. G., & Jones, D. T. (2021) · doi:10.1101/2021.08.24.457549 · Cited by 33 · see citing works
Self-citationBroad-range capsule-dependent lytic Sugarlandvirus against Klebsiella sp.
Concha-Eloko, R., Barberán-Martínez, P., Sanjuán, R., & Domingo‐Calap, P. (2023) · Microbiology Spectrum · doi:10.1128/spectrum.04298-22 · Cited by 19 · see citing works
Using metagenomic data to boost protein structure prediction and discovery
Hou, Q., Pucci, F., Pan, F., Xue, F.-Z., Rooman, M., & Feng, Q. (2022) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2021.12.030 · Cited by 16 · see citing works
- 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
- Semantic Scholar
- fff45e3718ad59bd3ffb018607bcfc9eeccb1a53
- Cited by
- 8
- References
- 57
- Citations by year
- 2023: 1 · 2022: 3 · 2021: 4
- Type
- posted content
- Language
- en
- Open access
- green
- doi.org
- 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