The scoring of poses in protein-protein docking: current capabilities and future directions
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Background: Protein-protein docking, which aims to predict the structure of a protein-protein complex from its unbound components, remains an unresolved challenge in structural bioinformatics. An important step is the ranking of docked poses using a scoring function, for which many methods have been developed. There is a need to explore the differences and commonalities of these methods with each other, as well as with functions developed in the fields of molecular dynamics and homology modelling. Results: We present an evaluation of 115 scoring functions on an unbound docking decoy benchmark covering 118 complexes for which a near-native solution can be found, yielding top 10 success rates of up to 58%. Hierarchical clustering is performed, so as to group together functions which identify near-natives in similar subsets of complexes. Three set theoretic approaches are used to identify pairs of scoring functions capable of correctly scoring different complexes. This shows that functions in different clusters capture different aspects of binding and are likely to work together synergistically. Conclusions: All functions designed specifically for docking perform well, indicating that functions are transferable between sampling methods. We also identify promising methods from the field of homology modelling. Further, differential success rates by docking difficulty and solution quality suggest a need for flexibility-dependent scoring. Investigating pairs of scoring functions, the set theoretic measures identify known scoring strategies as well as a number of novel approaches, indicating promising augmentations of traditional scoring methods. Such augmentation and parameter combination strategies are discussed in the context of the learning-to-rank paradigm.
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
HADDOCK: A Protein−Protein Docking Approach Based on Biochemical or Biophysical Information
Dominguez, C., Boelens, R., & Bonvin, A. M. J. J. (2003) · Journal of the American Chemical Society · doi:10.1021/ja026939x · Cited by 3,187 · cited 1×
“These range from composite scoring functions using a linear combination of terms, usually models of the underlying physical phenomena at play [52-65], to methods derived from the statistics of structural databases [63,66-70], docking decoys [71-75], experimental binding energies [76], methods based on interface compos…”
MethodLearning to rank using gradient descent
Burges, C., Shaked, T., Renshaw, E., Lazier, A., Deeds, M., Hamilton, N., & Hullender, G. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102363 · Cited by 2,836 · cited 1×
“Similarly a pairwise ranking approach can be formulated as pairwise classification or pairwise regression [129-136], for instance where a model is trained on restraints derived from the fact that acceptable docking poses are superior to incorrect poses, medium are superior to acceptable and incorrect poses, and so on.”
BackgroundLearning to rank: from pairwise approach to listwise approach
Cao, Z., Qin, T., Liu, T.-Y., Tsai, M.-F., & Li, H. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273513 · Cited by 1,960 · cited 1×
“Further, listwise ranking methods could be employed where, instead of viewing each pose independently and assigning it a score, and instead of comparing pairs of poses to determine which is superior, the whole list is ranked simultaneously as an inseparable set [137-142].”
MethodGuerois, R., Nielsen, J. E., & Serrano, L. (2002) · Journal of Molecular Biology · doi:10.1016/s0022-2836(02)00442-4 · Cited by 1,728 · cited 1×
“The 3D structures of a proteinprotein complex can be used to estimate the effect of mutations [16-21], and thus for protein design [22-29] and determining the functional consequences of mutations associated with diseases (for instance [30]).”
BackgroundZDOCK: An initial‐stage protein‐docking algorithm
Chen, R., Li, L., & Weng, Z. (2003) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.10389 · Cited by 1,393 · cited 1×
“These range from composite scoring functions using a linear combination of terms, usually models of the underlying physical phenomena at play [52-65], to methods derived from the statistics of structural databases [63,66-70], docking decoys [71-75], experimental binding energies [76], methods based on interface compos…”
Method(2006) · doi:10.7551/mitpress/7503.003.0029 · Cited by 753
Three-dimensional reconstruction of protein networks provides insight into human genetic disease
Wang, X., Wei, X., Thijssen, B., Das, J., Lipkin, S. M., & Yu, H. (2012) · Nature Biotechnology · doi:10.1038/nbt.2106 · Cited by 385
Moal, I. H., & Fernández-Recio, J. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts489 · Cited by 281
Self-citationSpecific 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 · cited 1×
“CP_BL [150] AP_dDFIRE [167] d The dDFIRE potential.”
Predicting free energy changes using structural ensembles
Benedix, A., Becker, C. M., de Groot, B. L., Caflisch, A., & Böckmann, R. A. (2009) · Nature Methods · doi:10.1038/nmeth0109-3 · Cited by 234
Cited by
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
“Thus, the scoring part of CAPRI [8] and benchmarks of scoring functions for docking [11,10,12,13] only focuses on the ability to select good models according to the CAPRI classification, completely ignoring the potential useful information in the lower ranked models in assessing the ability to…”
MethodInfluentialVreven, 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
Self-citationJankauskaitė, J., Jiménez-García, B., Dapkūnas, J., Fernández-Recio, J., & Moal, I. H. (2019) · Bioinformatics · doi:10.1093/bioinformatics/bty635 · Cited by 389
“functions [48], [46] which were subsequently implemented in the CCharPPI web server for characterising protein-protein interactions [49], as well as being used for ranking docked poses [45], [58], [6], [50].”
MethodSelf-citationImproving peptide-protein docking with AlphaFold-Multimer using forced sampling
Johansson-Åkhe, I., & Wallner, B. (2022) · Frontiers in Bioinformatics · doi:10.3389/fbinf.2022.959160 · Cited by 162
Shor, B., & Schneidman-Duhovny, D. (2024) · Nature Methods · doi:10.1038/s41592-024-02174-0 · Cited by 85
Metadata
- Authors
- Moal, I. H., Torchala, M., Bates, P. A., & Fernández-Recio, J.
- Venue
- BMC Bioinformatics
- Published
- 2013-10-01
- Volume
- 14
- Issue
- 1
- Pages
- 286-286
- ISSN
- 1471-2105 (ISSN-L)
- OpenAlex
- W2100025509
- Cited by
- 116
- References
- 11
- FWCI
- 4.84
- 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: The scoring of poses in protein-protein docking: current capabilities and future directions. https://app.cochat.ai/papers/10.1186/1471-2105-14-286
- The paper
- Moal, I. H., Torchala, M., Bates, P. A., & Fernández-Recio, J. (2013). The scoring of poses in protein-protein docking: current capabilities and future directions. BMC Bioinformatics. https://doi.org/10.1186/1471-2105-14-286
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.