Driven to near‐experimental accuracy by refinement via molecular dynamics simulations
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Protein model refinement has been an essential part of successful protein structure prediction. Molecular dynamics simulation‐based refinement methods have shown consistent improvement of protein models. There had been progress in the extent of refinement for a few years since the idea of ensemble averaging of sampled conformations emerged. There was little progress in CASP12 because conformational sampling was not sufficiently diverse due to harmonic restraints. During CASP13, a new refinement method was tested that achieved significant improvements over CASP12. The new method intended to address previous bottlenecks in the refinement problem by introducing new features. Flat‐bottom harmonic restraints replaced harmonic restraints, sampling was performed iteratively, and a new scoring function and selection criteria were used. The new protocol expanded conformational sampling at reduced computational costs. In addition to overall improvements, some models were refined significantly to near‐experimental accuracy.
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
OpenMM 7: Rapid development of high performance algorithms for molecular dynamics
Eastman, P., Swails, J., Chodera, J. D., McGibbon, R. T., Zhao, Y., Beauchamp, K. A., Wang, L.-P., Simmonett, A. C., Harrigan, M. P., Stern, C. D., et al. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005659 · Cited by 2,748 · cited 2×
“48 The equilibration and production runs of MD simulations were performed by using the OpenMM 38 Python library.”
MethodHHblits: 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
Leaver-Fay (2011) · doi:10.1016/b978-0-12-381270-4.00019-6 · Cited by 1,904
LGA: a method for finding 3D similarities in protein structures
Zemla, A. (2003) · Nucleic Acids Research · doi:10.1093/nar/gkg571 · Cited by 1,069
Accurate 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
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
The protein structure prediction problem could be solved using the current PDB library
Zhang, Y., & Skolnick, J. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0407152101 · Cited by 297 · cited 1×
“it has become possible to predict protein structures with high accuracy.(2) Increased coverage of the protein fold space means that it is more likely that close homolog structures suitable for template-based”
BackgroundProtein structure prediction: when is it useful?
Zhang, Y. (2009) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2009.02.005 · Cited by 277 · cited 1×
“1 Due to an increasing number of experimentally resolved protein structures and progress in template-based modeling methods, it has become possible to predict protein structures with high accuracy.”
BackgroundSpecific interactions for ab initio folding of protein terminal regions with secondary structures
Yang, Y., & Zhou, Y. (2008) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.21968 · Cited by 245
Assessment of contact predictions in CASP12: Co‐evolution and deep learning coming of age
Schaarschmidt, J., Monastyrskyy, B., Kryshtafovych, A., & Bonvin, A. M. J. J. (2018) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25407 · Cited by 177 · cited 1×
“3 7-11 If sufficient residue contact information is available, high-resolution models can be built even when there is no homologous structure available as a template.”
Background
Cited by
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
Performance and Its Limits in Rigid Body Protein-Protein Docking
Desta, I. T., Porter, K. A., Xia, B., Kozakov, D., & Vajda, S. (2020) · Structure · doi:10.1016/j.str.2020.06.006 · Cited by 703
Critical assessment of methods of protein structure prediction (CASP)—Round XIII
Kryshtafovych, A., Schwede, T., Topf, M., Fidelis, K., & Moult, J. (2019) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25823 · Cited by 506
Improved protein structure refinement guided by deep learning based accuracy estimation
Hiranuma, N., Park, H., Baek, M., Anishchenko, I., Dauparas, J., & Baker, D. (2021) · Nature Communications · doi:10.1038/s41467-021-21511-x · Cited by 243
Metadata
- Authors
- Heo, L., Arbour, C. F., & Feig, M.
- Venue
- Proteins: Structure, Function, and Bioinformatics
- Publisher
- Wiley
- Published
- 2019-06-24
- Volume
- 87
- Issue
- 12
- Pages
- 1263-1275
- ISSN
- 0887-3585 (ISSN-L)
- 1097-0134
- OpenAlex
- W2949975032
- Cited by
- 36
- References
- 10
- FWCI
- 2.22
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.