Rapid Design of Knowledge-Based Scoring Potentials for Enrichment of Near-Native Geometries in Protein-Protein Docking
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Protein-protein docking protocols aim to predict the structures of protein-protein complexes based on the structure of individual partners. Docking protocols usually include several steps of sampling, clustering, refinement and re-scoring. The scoring step is one of the bottlenecks in the performance of many state-of-the-art protocols. The performance of scoring functions depends on the quality of the generated structures and its coupling to the sampling algorithm. A tool kit, GRADSCOPT (GRid Accelerated Directly SCoring OPTimizing), was designed to allow rapid development and optimization of different knowledge-based scoring potentials for specific objectives in protein-protein docking. Different atomistic and coarse-grained potentials can be created by a grid-accelerated directly scoring dependent Monte-Carlo annealing or by a linear regression optimization. We demonstrate that the scoring functions generated by our approach are similar to or even outperform state-of-the-art scoring functions for predicting near-native solutions. Of additional importance, we find that potentials specifically trained to identify the native bound complex perform rather poorly on identifying acceptable or medium quality (near-native) solutions. In contrast, atomistic long-range contact potentials can increase the average fraction of near-native poses by up to a factor 2.5 in the best scored 1% decoys (compared to existing scoring), emphasizing the need of specific docking potentials for different steps in the docking protocol.
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
Folding funnels, binding funnels, and protein function
Tsai, C., Kumar, S., Ma, B., & Nussinov, R. (1999) · Protein Science · doi:10.1110/ps.8.6.1181 · Cited by 648 · cited 1×
“Moreover, energy funnels of protein complexes appear to be narrow towards the native structure [20], so that already small deviations on the interface cause large differences in energy.”
DockQ: A Quality Measure for Protein-Protein Docking Models
Basu, S., & Wallner, B. (2016) · PLOS ONE · doi:10.1371/journal.pone.0161879 · Cited by 460
Vreven, T., Moal, I. H., Vangone, A., Pierce, B. G., Kastritis, P. L., Torchala, M., Chaleil, R., Jiménez-García, B., Bates, P. A., Fernandez-Recio, J., et al. (2015) · Journal of Molecular Biology · doi:10.1016/j.jmb.2015.07.016 · Cited by 424 · cited 1×
“0 to form a benchmark for the training of the parameters of our presented scoring potentials [34, 35].”
Cited by
Computational prediction of protein–protein binding affinities
Siebenmorgen, T., & Zacharias, M. (2020) · WIREs Computational Molecular Science · doi:10.1002/wcms.1448 · Cited by 184
“69 – 72 The potentials also vary in the number of atom or pseudo atom types or the reference state from which the expected contact or distance probability for atom-pairs are derived.”
BackgroundSelf-citation“Dividing and Conquering” and “Caching” in Molecular Modeling
Cao, X., & Tian, P. (2021) · International Journal of Molecular Sciences · doi:10.3390/ijms22095053 · Cited by 10
The repetitive local sampling and the local distribution theory
(2021) · doi:10.1002/wcms.1588 · Cited by 2
The repetitive local sampling and the local distribution theory
TIAN, P. (2021) · doi:10.33774/chemrxiv-2021-v223l-v3
Metadata
- Authors
- Sasse, A., de Vries, S. J., Schindler, C. E. M., de Beauchêne, I. C., & Zacharias, M.
- Venue
- PLOS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2017-01-24
- Volume
- 12
- Issue
- 1
- Pages
- e0170625
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2581228326
- Cited by
- 13
- References
- 3
- FWCI
- 0.39
- 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: Rapid Design of Knowledge-Based Scoring Potentials for Enrichment of Near-Native Geometries in Protein-Protein Docking. https://app.cochat.ai/papers/10.1371/journal.pone.0170625
- The paper
- Sasse, A., de Vries, S. J., Schindler, C. E. M., de Beauchêne, I. C., & Zacharias, M. (2017). Rapid Design of Knowledge-Based Scoring Potentials for Enrichment of Near-Native Geometries in Protein-Protein Docking. PLOS ONE. https://doi.org/10.1371/journal.pone.0170625
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.