Toward an accurate prediction of inter-residue distances in proteins using 2D recursive neural networks
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
BACKGROUND: Protein inter-residue contact maps provide a translation and rotation invariant topological representation of a protein. They can be used as an intermediary step in protein structure predictions. However, the prediction of contact maps represents an unbalanced problem as far fewer examples of contacts than non-contacts exist in a protein structure.In this study we explore the possibility of completely eliminating the unbalanced nature of the contact map prediction problem by predicting real-value distances between residues. Predicting full inter-residue distance maps and applying them in protein structure predictions has been relatively unexplored in the past. RESULTS: We initially demonstrate that the use of native-like distance maps is able to reproduce 3D structures almost identical to the targets, giving an average RMSD of 0.5Å. In addition, the corrupted physical maps with an introduced random error of ±6Å are able to reconstruct the targets within an average RMSD of 2Å.After demonstrating the reconstruction potential of distance maps, we develop two classes of predictors using two-dimensional recursive neural networks: an ab initio predictor that relies only on the protein sequence and evolutionary information, and a template-based predictor in which additional structural homology information is provided. We find that the ab initio predictor is able to reproduce distances with an RMSD of 6Å, regardless of the evolutionary content provided. Furthermore, we show that the template-based predictor exploits both sequence and structure information even in cases of dubious homology and outperforms the best template hit with a clear margin of up to 3.7Å.Lastly, we demonstrate the ability of the two predictors to reconstruct the CASP9 targets shorter than 200 residues producing the results similar to the state of the machine learning art approach implemented in the Distill server. CONCLUSIONS: The methodology presented here, if complemented by more complex reconstruction protocols, can represent a possible path to improve machine learning algorithms for 3D protein structure prediction. Moreover, it can be used as an intermediary step in protein structure predictions either on its own or complemented by NMR restraints.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Protein 3D Structure Computed from Evolutionary Sequence Variation
Marks, D. S., Colwell, L. J., Sheridan, R., Hopf, T. A., Pagnani, A., Zecchina, R., & Sander, C. (2011) · PLoS ONE · doi:10.1371/journal.pone.0028766 · Cited by 1,144 · cited 4×
“id [%] [0, 10) [10, 20) [20, 30) [30, 40) [40, 50)”
BackgroundInfluentialLGA: a method for finding 3D similarities in protein structures
Zemla, A. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg571 · Cited by 1,069 · cited 1×
“Unlike the RMSD measure which is based on a single general superposition between two structures, the GDT algorithm is based on multiple local superpositions [37].”
MethodTopology fingerprint approach to the inverse protein folding problem
Godzik, A., Kolinski, A., & Skolnick, J. (1992) · Journal of Molecular Biology · doi:10.1016/0022-2836(92)90693-e · Cited by 339 · cited 1×
“structures similarity [23-25], in the prediction of protein folding rates [26], protein disorder [27] and inter-domain”
Background
Cited by
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
Deep learning methods in protein structure prediction
Torrisi, M., Pollastri, G., & Le, Q. (2020) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2019.12.011 · Cited by 284
Self-citationDeep learning in biomedical data science
Baldi, P. (2018) · Annual Review of Biomedical Data Science · doi:10.1146/annurev-biodatasci-080917-013343 · Cited by 119
rawMSA: 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
Self-citationKandathil, S. M., Greener, J. G., Lau, A. M., & Jones, D. T. (2020) · doi:10.1101/2020.11.27.401232 · Cited by 8
Metadata
- Authors
- Kukic, P., Mirabello, C., Tradigo, G., Walsh, I., Veltri, P., & Pollastri, G.
- Venue
- BMC Bioinformatics
- Published
- 2014-01-10
- Volume
- 15
- Issue
- 1
- Pages
- 6-6
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2037589601
- Cited by
- 49
- References
- 3
- FWCI
- 1.10
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Toward an accurate prediction of inter-residue distances in proteins using 2D recursive neural networks. https://app.cochat.ai/papers/10.1186/1471-2105-15-6
- The paper
- Kukic, P., Mirabello, C., Tradigo, G., Walsh, I., Veltri, P., & Pollastri, G. (2014). Toward an accurate prediction of inter-residue distances in proteins using 2D recursive neural networks. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-15-6
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.