Trajectory-based training enables protein simulations with accurate folding and Boltzmann ensembles in cpu-hours
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
An ongoing challenge in protein chemistry is to identify the underlying interaction energies that capture protein dynamics. The traditional trade-off in biomolecular simulation between accuracy and computational efficiency is predicated on the assumption that detailed force fields are typically well-parameterized, obtaining a significant fraction of possible accuracy. We re-examine this trade-off in the more realistic regime in which parameterization is a greater source of error than the level of detail in the force field. To address parameterization of coarse-grained force fields, we use the contrastive divergence technique from machine learning to train from simulations of 450 proteins. In our procedure, the computational efficiency of the model enables high accuracy through the precise tuning of the Boltzmann ensemble. This method is applied to our recently developed Upside model, where the free energy for side chains is rapidly calculated at every time-step, allowing for a smooth energy landscape without steric rattling of the side chains. After this contrastive divergence training, the model is able to de novo fold proteins up to 100 residues on a single core in days. This improved Upside model provides a starting point both for investigation of folding dynamics and as an inexpensive Bayesian prior for protein physics that can be integrated with additional experimental or bioinformatic data.
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
How fast-folding proteins fold
Lindorff-Larsen, K., Piana, S., Dror, R. O., & Shaw, D. E. (2011) · Science · doi:10.1126/science.1208351 · Cited by 1,980
Bowman, G. R., Beauchamp, K. A., Boxer, G., & Pande, V. S. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3216567 · Cited by 396
An improved protein decoy set for testing energy functions for protein structure prediction
Tsai, J., Bonneau, R., Morozov, A. V., Kuhlman, B., Rohl, C. A., & Baker, D. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10454 · Cited by 158
Cited by
A guide to machine learning for biologists
Greener, J. G., Kandathil, S. M., Moffat, L., & Jones, D. T. (2022) · Nature Reviews Molecular Cell Biology · doi:10.1038/s41580-021-00407-0 · Cited by 2,127
AlQuraishi, M., & Sorger, P. K. (2021) · Nature Methods · doi:10.1038/s41592-021-01283-4 · Cited by 96
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
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
“So far, only a couple of learning methods have exploited solely and directly this information to efficiently fold proteins de novo [46, 47].”
BackgroundGreener, J. G., & Jones, D. T. (2021) · PLOS ONE · doi:10.1371/journal.pone.0256990 · Cited by 29
Metadata
- Authors
- Jumper, J. M., Faruk, N. F., Freed, K. F., & Sosnick, T. R.
- Venue
- PLOS Computational Biology
- Publisher
- Public Library of Science (PLoS)
- Published
- 2018-12-27
- Volume
- 14
- Issue
- 12
- Pages
- e1006578
- ISSN
- 1553-734X (ISSN-L)
- 1553-7358
- OpenAlex
- W2908096659
- Cited by
- 44
- References
- 3
- FWCI
- 1.26
- 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: Trajectory-based training enables protein simulations with accurate folding and Boltzmann ensembles in cpu-hours. https://app.cochat.ai/papers/10.1371/journal.pcbi.1006578
- The paper
- Jumper, J. M., Faruk, N. F., Freed, K. F., & Sosnick, T. R. (2018). Trajectory-based training enables protein simulations with accurate folding and Boltzmann ensembles in cpu-hours. PLOS Computational Biology. https://doi.org/10.1371/journal.pcbi.1006578
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.