The scoring of poses in protein-protein docking: current capabilities and future directions
Open Access
- 1 October 2013
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 14 (1) , 286
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.Keywords
This publication has 173 references indexed in Scilit:
- Prediction of protein–protein binding free energiesProtein Science, 2012
- Integration of protein motions with molecular networks reveals different mechanisms for permanent and transient interactionsProtein Science, 2011
- On the analysis of protein–protein interactions via knowledge‐based potentials for the prediction of protein–protein dockingProtein Science, 2011
- A structure‐based benchmark for protein–protein binding affinityProtein Science, 2011
- Protein–protein docking benchmark version 4.0Proteins: Structure, Function, and Bioinformatics, 2010
- Discrimination of near‐native structures in protein–protein docking by testing the stability of local minimaProteins: Structure, Function, and Bioinformatics, 2008
- A combination of rescoring and refinement significantly improves protein docking performanceProteins: Structure, Function, and Bioinformatics, 2008
- A simple reference state makes a significant improvement in near‐native selections from structurally refined docking decoysProteins: Structure, Function, and Bioinformatics, 2007
- Inferring ideal amino acid interaction forms from statistical protein contact potentialsProteins: Structure, Function, and Bioinformatics, 2005
- Are proteins ideal mixtures of amino acids? Analysis of energy parameter setsProtein Science, 1995