Journal Article10.1002/PROT.21949
An iterative knowledge-based scoring function for protein–protein recognition
Sheng-You Huang,Xiaoqin Zou +1 more
301
TL;DR: A distance‐dependent knowledge‐based scoring function to predict protein–protein interactions and the binding scores predicted by ITScore‐PP correlated well with the experimentally determined binding affinities, yielding a correlation coefficient of R = 0.71.
read more
Abstract: Using an efficient iterative method, we have developed a distance-dependent knowledge-based scoring function to predict protein-protein interactions. The function, referred to as ITScore-PP, was derived using the crystal structures of a training set of 851 protein-protein dimeric complexes containing true biological interfaces. The key idea of the iterative method for deriving ITScore-PP is to improve the interatomic pair potentials by iteration, until the pair potentials can distinguish true binding modes from decoy modes for the protein-protein complexes in the training set. The iterative method circumvents the challenging reference state problem in deriving knowledge-based potentials. The derived scoring function was used to evaluate the ligand orientations generated by ZDOCK 2.1 and the native ligand structures on a diverse set of 91 protein-protein complexes. For the bound test cases, ITScore-PP yielded a success rate of 98.9% if the top 10 ranked orientations were considered. For the more realistic unbound test cases, the corresponding success rate was 40.7%. Furthermore, for faster orientational sampling purpose, several residue-level knowledge-based scoring functions were also derived following the similar iterative procedure. Among them, the scoring function that uses the side-chain center of mass (SCM) to represent a residue, referred to as ITScore-PP(SCM), showed the best performance and yielded success rates of 71.4% and 30.8% for the bound and unbound cases, respectively, when the top 10 orientations were considered. ITScore-PP was further tested using two other published protein-protein docking decoy sets, the ZDOCK decoy set and the RosettaDock decoy set. In addition to binding mode prediction, the binding scores predicted by ITScore-PP also correlated well with the experimentally determined binding affinities, yielding a correlation coefficient of R = 0.71 on a test set of 74 protein-protein complexes with known affinities. ITScore-PP is computationally efficient. The average run time for ITScore-PP was about 0.03 second per orientation (including optimization) on a personal computer with 3.2 GHz Pentium IV CPU and 3.0 GB RAM. The computational speed of ITScore-PP(SCM) is about an order of magnitude faster than that of ITScore-PP. ITScore-PP and/or ITScore-PP(SCM) can be combined with efficient protein docking software to study protein-protein recognition.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The ClusPro web server for protein-protein docking.
Dima Kozakov,David R. Hall,Bing Xia,Kathryn A. Porter,Dzmitry Padhorny,Christine Yueh,Dmitri Beglov,Sandor Vajda +7 more
TL;DR: This protocol describes the use of the various options, the construction of auxiliary restraints files, the selection of the energy parameters, and the analysis of the results of the ClusPro server.
The HDOCK server for integrated protein-protein docking.
TL;DR: The HDOCK server is developed for template-based and template-free protein–protein docking, using amino acid sequences or PDB structures as inputs, and can incorporate SAXS data and can be applied to protein–RNA/DNA docking.
1.1K
HDOCK: a web server for protein-protein and protein-DNA/RNA docking based on a hybrid strategy.
TL;DR: Tested on the cases with weakly homologous complexes of <30% sequence identity from five docking benchmarks, the HDOCK pipeline tied with template-based modeling on the protein–protein and protein–DNA benchmarks and performed better than template- based modelingon the three protein–RNA benchmarks when the top 10 predictions were considered.
•Posted Content
Market Force, Ecology, and Evolution
TL;DR: In financial markets, an excess of buying tends to drive prices up, and a excess of selling tend to drive them down as mentioned in this paper, and this is called market impact, which is a non-equilibrium theory for price formation, based on a simplified model for market making.
Scoring functions and their evaluation methods for protein-ligand docking: recent advances and future directions.
TL;DR: Three basic types of scoring functions (force-field, empirical, and knowledge-based) and the consensus scoring technique that are used for protein-ligand docking are reviewed and a discussion of the challenges faced by existing scoring functions and possible future directions for developing improved scoring functions is discussed.
496
References
The Protein Data Bank
Helen M. Berman,John D. Westbrook,Zukang Feng,Gary L. Gilliland,Talapady N. Bhat,Helge Weissig,Ilya N. Shindyalov,Philip E. Bourne +7 more
TL;DR: The goals of the PDB are described, the systems in place for data deposition and access, how to obtain further information and plans for the future development of the resource are described.
A simplex method for function minimization
John A. Nelder,R. Mead +1 more
TL;DR: A method is described for the minimization of a function of n variables, which depends on the comparison of function values at the (n 41) vertices of a general simplex, followed by the replacement of the vertex with the highest value by another point.
30.6K
Automated docking using a Lamarckian genetic algorithm and an empirical binding free energy function
Garrett M. Morris,David S. Goodsell,Robert Scott Halliday,Ruth Huey,William E. Hart,Richard K. Belew,Arthur J. Olson +6 more
TL;DR: It is shown that both the traditional and Lamarckian genetic algorithms can handle ligands with more degrees of freedom than the simulated annealing method used in earlier versions of AUTODOCK, and that the Lamarckia genetic algorithm is the most efficient, reliable, and successful of the three.
A new force field for molecular mechanical simulation of nucleic acids and proteins
S. J. Weiner,Peter A. Kollman,David A. Case,U. C. Singh,Caterina Ghio,Giuliano Alagona,Salvatore Profeta,Paul K. Weiner +7 more
TL;DR: In this paper, a force field for simulation of nucleic acids and proteins is presented, which is based on the ECEPP, UNECEPP, and EPEN energy refinement software.
4.6K
An all atom force field for simulations of proteins and nucleic acids.
TL;DR: An all atom potential energy function for the simulation of proteins and nucleic acids and the first general vibrational analysis of all five nucleic acid bases with a molecular mechanics potential approach is presented.
3.4K