蛋白质-蛋白质分子对接中打分函数研究进展

分子对接是研究分子间相互作用与识别的有效方法.其中,用于近天然构象挑选的打分函数的合理设计对于对接中复合物结构的成功预测至关重要.本文回顾了蛋白质-蛋白质分子对接组合打分函数中一些主要打分项,包括几何互补项、界面接触面积、范德华相互作用能、静电相互作用能以及统计成对偏好势等打分项的计算方法.结合本研究小组的工作,介绍了目前普遍使用的打分方案以及利用与结合位点有关的信息进行结构筛选的几种策略,比较并总结了常用打分函数的特点.最后,分析并指出了当前蛋白质-蛋白质对接打分函数所存在的主要问题,并对未来的工作进行了展望.     

A Bayesian statistical approach of improving knowledge‐based scoring functions for protein–ligand interactions

Knowledge‐based scoring functions are widely used for assessing putative complexes in protein–ligand and protein–protein docking and for structure prediction. Even with large training sets, knowledge‐based scoring functions face the inevitable problem of sparse data. Here, we have developed a novel approach for handling the sparse data problem that is based on estimating the inaccuracies in knowledge‐based scoring functions. This inaccuracy estimation is used to automatically weight the knowledge‐based scoring function with an alternative, force‐field‐based potential (FFP) that does not rely on training data and can, therefore, provide an improved approximation of the interactions between rare chemical groups. The current version of STScore, a protein–ligand scoring function using our method, achieves a binding mode prediction success rate of 91% on the set of 100 complexes by Wang et al., and a binding affinity correlation of 0.514 with the experimentally determined affinities in PDBbind. The method presented here may be used with other FFPs and other knowledge‐based scoring functions and can also be applied to protein–protein docking and protein structure prediction. © 2014 Wiley Periodicals, Inc.     

Docking to heme proteins

In silico screening has become a valuable tool in drug design, but some drug targets represent real challenges for docking algorithms. This is especially true for metalloproteins, whose interactions with ligands are difficult to parametrize. Our docking algorithm, EADock, is based on the CHARMM force field, which assures a physically sound scoring function and a good transferability to a wide range of systems, but also exhibits difficulties in case of some metalloproteins. Here, we consider the therapeutically important case of heme proteins featuring an iron core at the active site. Using a standard docking protocol, where the iron–ligand interaction is underestimated, we obtained a success rate of 28% for a test set of 50 heme‐containing complexes with iron‐ligand contact. By introducing Morse‐like metal binding potentials (MMBP), which are fitted to reproduce density functional theory calculations, we are able to increase the success rate to 62%. The remaining failures are mainly due to specific ligand–water interactions in the X‐ray structures. Testing of the MMBP on a second data set of non iron binders (14 cases) demonstrates that they do not introduce a spurious bias towards metal binding, which suggests that they may reliably be used also for cross‐docking studies. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2009     

A novel scoring function for molecular docking

We present a novel scoring function for docking of small molecules to protein binding sites. The scoring function is based on a combination of two main approaches used in the field, the empirical and knowledge-based approaches. To calibrate the scoring function we used an iterative procedure in which a ligand's position and its score were determined self-consistently at each iteration. The scoring function demonstrated superiority in prediction of ligand positions in docking tests against the commonly used Dock, FlexX and Gold docking programs. It also demonstrated good accuracy of binding affinity prediction for the docked ligands.     

Rescoring of docking poses under Occam’s Razor: are there simpler solutions?

Ligand affinity prediction from docking simulations is usually performed by means of highly empirical and diverse protocols. These protocols often involve the re-scoring of poses generated by a force field (FF) based Hamiltonian to provide either estimated binding affinities—or alternatively, some empirical goodness score. Re-scoring is performed by so-called scoring functions—typically, a reweighted sum of FF terms augmented by additional terms (e.g., desolvation/entropic penalty, hydrophobicity, aromatic interactions etc.). Sometimes, the scoring function actually drives ligand positioning, but often it only operates on the best scoring poses ranked top by the initial ligand positioning tool. In either of these rather intricate scenarios, scoring functions are docking-specific models, and most require machine-learning-based calibration. Therefore, docking simulations are less straightforward when compared to “standard” molecular simulations in which the FF Hamiltonian defines the energy, and affinity emerges as an ensemble average property over pools of representative conformers (i.e., the trajectory). Paraphrasing on Occam’s Razor principle, additional model complexity is only acceptable if demonstrated to bring a significant improvement of prediction quality. In this work we therefore examined whether the complexity inherent to scoring functions is indeed justified. For this purpose we compared sampler for multiple protein–ligand entities, a general purpose conformation sampler based on the AMBER/GAFF FF, complemented with continuum solvation terms, with several state of the art docking tools that rely on calibrated scoring functions (Glide, Gold, Autodock-Vina) in terms of its ability to top-rank the actives from large and diverse ligand series associated with various proteins. There is no clear winner of this study, where each program performed well on most of the targets, but also failed with respect to at least one of them. Therefore, a well-parameterized force field with a simple, energy-based ligand ranking protocol appears to be an as effective docking protocol as intricate rescoring strategies based on scoring functions. A tool that can sample the conformational space of the free ligand, the bound ligand and the protein binding site using the same force field may avoid many of the approximations common to contemporary docking protocols and allow e.g., for docking into highly flexible active sites, when current scoring functions are not well suited to estimate receptor strain energies.     

Validation of an empirical RNA-ligand scoring function for fast flexible docking using RiboDock®

We report the design and validation of a fast empirical function for scoring RNA-ligand interactions, and describe its implementation within RiboDock, a virtual screening system for automated flexible docking. Building on well-known protein-ligand scoring function foundations, features were added to describe the interactions of common RNA-binding functional groups that were not handled adequately by conventional terms, to disfavour non-complementary polar contacts, and to control non-specific charged interactions. The results of validation experiments against known structures of RNA-ligand complexes compare favourably with previously reported methods. Binding modes were well predicted in most cases and good discrimination was achieved between native and non-native ligands for each binding site, and between native and non-native binding sites for each ligand. Further evidence of the ability of the method to identify true RNA binders is provided by compound selection ('enrichment factor') experiments based around a series of HIV-1 TAR RNA-binding ligands. Significant enrichment in true binders was achieved amongst high scoring docking hits, even when selection was from a library of structurally related, positively charged molecules. Coupled with a semi-automated cavity detection algorithm for identification of putative ligand binding sites, also described here, the method is suitable for the screening of very large databases of molecules against RNA and RNA-protein interfaces, such as those presented by the bacterial ribosome.     

Maximum common binding modes (MCBM): consensus docking scoring using multiple ligand information and interaction fingerprints

Improving the scoring functions for small molecule-protein docking is a highly challenging task in current computational drug design. Here we present a novel consensus scoring concept for the prediction of binding modes for multiple known active ligands. Similar ligands are generally believed to bind to their receptor in a similar fashion. The presumption of our approach was that the true binding modes of similar ligands should be more similar to each other compared to false positive binding modes. The number of conserved (consensus) interactions between similar ligands was used as a docking score. Patterns of interactions were modeled using ligand receptor interaction fingerprints. Our approach was evaluated for four different data sets of known cocrystal structures (CDK-2, dihydrofolate reductase, HIV-1 protease, and thrombin). Docking poses were generated with FlexX and rescored by our approach. For comparison the CScore scoring functions from Sybyl were used, and consensus scores were calculated thereof. Our approach performed better than individual scoring functions and was comparable to consensus scoring. Analysis of the distribution of docking poses by self-organizing maps (SOM) and interaction fingerprints confirmed that clusters of docking poses composed of multiple ligands were preferentially observed near the native binding mode. Being conceptually unrelated to commonly used docking scoring functions our approach provides a powerful method to complement and improve computational docking experiments.     

Comparing search strategies for finding global optima on energy landscapes

We provide some tests of the convex global underestimator (CGU) algorithm, which aims to find global minima on funnel-shaped energy landscapes. We use two different potential functions—the reduced Lennard–Jones cluster potential, and the modified Sun protein folding potential, to compare the CGU algorithm with the simplest versions of the traditional trajectory-based search methods, simulated annealing (SA), and Monte Carlo (MC). For both potentials, the CGU reaches energies lower on the landscapes than both SA and MC, even when SA and MC are given the same number of starting points as in a full CGU run or when all methods are given the same amount of computer time. The CGU consistently finds the global minima of the Lennard–Jones potential for all cases with up to at least n=30 degrees of freedom. Finding the global or near-global minimum in the CGU method requires polynomial time [scaling between O(n³) and O(n⁴)], on average. ©1999 John Wiley & Sons, Inc. J Comput Chem 20: 1527–1532, 1999     

Evaluation of a knowledge‐based potential of mean force for scoring docked protein–ligand complexes

The Biomolecular Ligand Energy Evaluation Protocol (BLEEP) is a knowledge‐based potential derived from high‐resolution X‐ray structures of protein–ligand complexes. The performance of this potential in ranking the hypothetical structures resulting from a docking study has been evaluated using fifteen protein–ligand complexes from the Protein Data Bank. In the majority of complexes BLEEP was successful in identifying the native (experimental) binding mode or an alternative of low rms deviation (from the native) as the lowest in energy. Overall BLEEP is slightly better than the DOCK energy function in discriminating native‐like modes. Even when alternative binding modes rank lower than the native structure, a reasonable energy is assigned to the latter. Breaking down the BLEEP scores into the atom–atom contributions reveals that this type of potential is grossly dominated by longer range interactions (>5 Å), which makes it relatively insensitive to small local variations in the binding site. However, despite this limitation, the lack, at present, of accurate protein–ligand potentials means that BLEEP is a promising approach to improve the filtering of structures resulting from docking programs. Moreover, BLEEP should improve with the continuously increasing number of complexes available in the PDB. © 2001 John Wiley & Sons, Inc. J Comput Chem 22: 673–688, 2001     

Effect of ligand volume correction on PMF scoring

Recently, a knowledge‐based scoring function has been introduced that estimates the protein‐binding affinity based on the 3D structure of a protein–ligand complex (J Med Chem 1999, 42, 791). A ligand volume correction factor has been proposed and applied to filter out intraligand interactions in this simplified potential approach. Here we evaluate the effect of the ligand volume correction on the predictive power of the PMF scoring function. It is found that the effect of the ligand volume correction is significant on the derived potentials and large on the overall score. However, the effect of the ligand correction on the predictive power of the scoring function appears to be smaller. For a test set containing serine proteases the predictive power of the PMF scoring function does not change with the introduction of the volume correction. For a test set of metalloprotease complexes, the predictive power of the PMF scoring function improves only slightly when the volume correction is applied. For five test sets comprising a total of 225 diverse protein ligand complexes taken from the Brookhaven Protein Data Bank it is found, however, that the introduction of the ligand volume correction consistently improves the correlation between the PMF scores and the measured binding affinities. The effect of the correction factor on docking/scoring experiments is also analyzed using a test set of 61 biphenyl inhibitor‐stromelysin complexes. © 2001 John Wiley & Sons, Inc. J Comput Chem 22: 418–425, 2001     

Determination of unlike-pair potential parameters from second virial coefficient data

Using available interaction virial coefficient data for forty-five non-polar binary systems, potential parameters for unlike interactions have been obtained by an analytical procedure for the Lennard—Jones (12-6) and Kihara intermolecular potentials.     

Customizing scoring functions for docking

Empirical scoring functions used in protein-ligand docking calculations are typically trained on a dataset of complexes with known affinities with the aim of generalizing across different docking applications. We report a novel method of scoring-function optimization that supports the use of additional information to constrain scoring function parameters, which can be used to focus a scoring function’s training towards a particular application, such as screening enrichment. The approach combines multiple instance learning, positive data in the form of ligands of protein binding sites of known and unknown affinity and binding geometry, and negative (decoy) data of ligands thought not to bind particular protein binding sites or known not to bind in particular geometries. Performance of the method for the Surflex-Dock scoring function is shown in cross-validation studies and in eight blind test cases. Tuned functions optimized with a sufficient amount of data exhibited either improved or undiminished screening performance relative to the original function across all eight complexes. Analysis of the changes to the scoring function suggest that modifications can be learned that are related to protein-specific features such as active-site mobility.     

Energetic analysis of fragment docking and application to structure-based pharmacophore hypothesis generation

We have developed a method that uses energetic analysis of structure-based fragment docking to elucidate key features for molecular recognition. This hybrid ligand- and structure-based methodology uses an atomic breakdown of the energy terms from the Glide XP scoring function to locate key pharmacophoric features from the docked fragments. First, we show that Glide accurately docks fragments, producing a root mean squared deviation (RMSD) of <1.0 Å for the top scoring pose to the native crystal structure. We then describe fragment-specific docking settings developed to generate poses that explore every pocket of a binding site while maintaining the docking accuracy of the top scoring pose. Next, we describe how the energy terms from the Glide XP scoring function are mapped onto pharmacophore sites from the docked fragments in order to rank their importance for binding. Using this energetic analysis we show that the most energetically favorable pharmacophore sites are consistent with features from known tight binding compounds. Finally, we describe a method to use the energetically selected sites from fragment docking to develop a pharmacophore hypothesis that can be used in virtual database screening to retrieve diverse compounds. We find that this method produces viable hypotheses that are consistent with known active compounds. In addition to retrieving diverse compounds that are not biased by the co-crystallized ligand, the method is able to recover known active compounds from a database screen, with an average enrichment of 8.1 in the top 1% of the database.     

AIScore chemically diverse empirical scoring function employing quantum chemical binding energies of hydrogen-bonded complexes

In this work we report on a novel scoring function that is based on the LUDI model and focuses on the prediction of binding affinities. AIScore extends the original FlexX scoring function using a chemically diverse set of hydrogen-bonded interactions derived from extensive quantum chemical ab initio calculations. Furthermore, we introduce an algorithmic extension for the treatment of multifurcated hydrogen bonds (XFurcate). Charged and resonance-assisted hydrogen bond energies and hydrophobic interactions as well as a scaling factor for implicit solvation were fitted to experimental data. To this end, we assembled a set of 101 protein-ligand complexes with known experimental binding affinities. Tightly bound water molecules in the active site were considered to be an integral part of the binding pocket. Compared to the original FlexX scoring function, AIScore significantly improves the prediction of the binding free energies of the complexes in their native crystal structures. In combination with XFurcate, AIScore yields a Pearson correlation coefficient of R P = 0.87 on the training set. In a validation run on the PDBbind test set we achieved an R P value of 0.46 for 799 attractively scored complexes, compared to a value of R P = 0.17 and 739 bound complexes obtained with the FlexX original scoring function. The redocking capability of AIScore, on the other hand, does not fully reach the good performance of the original FlexX scoring function. This finding suggests that AIScore should rather be used for postscoring in combination with the standard FlexX incremental ligand construction scheme.     

Incorporating specificity into optimization: evaluation of SPA using CSAR 2014 and CASF 2013 benchmarks

Scoring functions of protein–ligand interactions are widely used in computationally docking software and structure-based drug discovery. Accurate prediction of the binding energy between the protein and the ligand is the main task of the scoring function. The accuracy of a scoring function is normally evaluated by testing it on the benchmarks of protein–ligand complexes. In this work, we report the evaluation analysis of an improved version of scoring function SPecificity and Affinity (SPA). By testing on two independent benchmarks Community Structure-Activity Resource (CSAR) 2014 and Comparative Assessment of Scoring Functions (CASF) 2013, the assessment shows that SPA is relatively more accurate than other compared scoring functions in predicting the interactions between the protein and the ligand. We conclude that the inclusion of the specificity in the optimization can effectively suppress the competitive state on the funnel-like binding energy landscape, and make SPA more accurate in identifying the “native” conformation and scoring the binding decoys. The evaluation of SPA highlights the importance of binding specificity in improving the accuracy of the scoring functions.     

LigDockCSA: protein-ligand docking using conformational space annealing

Protein–ligand docking techniques are one of the essential tools for structure‐based drug design. Two major components of a successful docking program are an efficient search method and an accurate scoring function. In this work, a new docking method called LigDockCSA is developed by using a powerful global optimization technique, conformational space annealing (CSA), and a scoring function that combines the AutoDock energy and the piecewise linear potential (PLP) torsion energy. It is shown that the CSA search method can find lower energy binding poses than the Lamarckian genetic algorithm of AutoDock. However, lower‐energy solutions CSA produced with the AutoDock energy were often less native‐like. The loophole in the AutoDock energy was fixed by adding a torsional energy term, and the CSA search on the refined energy function is shown to improve the docking performance. The performance of LigDockCSA was tested on the Astex diverse set which consists of 85 protein–ligand complexes. LigDockCSA finds the best scoring poses within 2 Å root‐mean‐square deviation (RMSD) from the native structures for 84.7% of the test cases, compared to 81.7% for AutoDock and 80.5% for GOLD. The results improve further to 89.4% by incorporating the conformational entropy. © 2011 Wiley Periodicals, Inc. J Comput Chem, 2011     

Attracting cavities for docking. Replacing the rough energy landscape of the protein by a smooth attracting landscape

Molecular docking is a computational approach for predicting the most probable position of ligands in the binding sites of macromolecules and constitutes the cornerstone of structure‐based computer‐aided drug design. Here, we present a new algorithm called Attracting Cavities that allows molecular docking to be performed by simple energy minimizations only. The approach consists in transiently replacing the rough potential energy hypersurface of the protein by a smooth attracting potential driving the ligands into protein cavities. The actual protein energy landscape is reintroduced in a second step to refine the ligand position. The scoring function of Attracting Cavities is based on the CHARMM force field and the FACTS solvation model. The approach was tested on the 85 experimental ligand–protein structures included in the Astex diverse set and achieved a success rate of 80% in reproducing the experimental binding mode starting from a completely randomized ligand conformer. The algorithm thus compares favorably with current state‐of‐the‐art docking programs. © 2015 The Authors. Journal of Computational Chemistry Published by Wiley Periodicals, Inc.     

B-spline method for energy minimization in grid-based molecular mechanics calculations

A method is described for molecular mechanics calculations based on a cubic B-spline approximation of the potential energy. This method is useful when parts of the system are allowed to remain fixed in position so that a potential energy grid can be precalculated and used to approximate the interaction energy between parts of a molecule or between molecules. We adapted and modified the conventional B-spline method to provide an approximation of the Empirical Conformational Energy Program for Peptides (ECEPP) potential energy function. The advantage of the B-spline method over simpler approximations is that the resulting B-spline function is C2 continuous, which allows minimization of the potential energy by any local minimization algorithm. The standard B-spline method provides a good approximation of the electrostatic energy; but in order to reproduce the Lennard–Jones and hydrogen-bonding functional forms accurately, it was necessary to modify the standard B-spline method. This modification of the B-spline method can also be used to improve the accuracy of trilinear interpolation for simulations that do not require continuous derivatives. As an example, we apply the B-spline method to rigid-body docking energy calculations using the ECEPP potential energy function. Energies are calculated for the complex of Phe-Pro-Arg with thrombin. For this system, we compare the performance of the B-spline method to that of the standard pairwise summation in terms of speed, accuracy, and overhead costs for a variety of grid spacings. In our rigid-body docking calculations, the B-spline method provided an accurate approximation of the total energy of the system, and it resulted in an 180-fold reduction in the time required for a single energy and gradient calculation for this system. © 1998 John Wiley & Sons, Inc. J Comput Chem 19: 71–85, 1998     

Exhaustive docking and solvated interaction energy scoring: lessons learned from the SAMPL4 challenge

We continued prospective assessments of the Wilma–solvated interaction energy (SIE) platform for pose prediction, binding affinity prediction, and virtual screening on the challenging SAMPL4 data sets including the HIV-integrase inhibitor and two host–guest systems. New features of the docking algorithm and scoring function are tested here prospectively for the first time. Wilma–SIE provides good correlations with actual binding affinities over a wide range of binding affinities that includes strong binders as in the case of SAMPL4 host–guest systems. Absolute binding affinities are also reproduced with appropriate training of the scoring function on available data sets or from comparative estimation of the change in target’s vibrational entropy. Even when binding modes are known, SIE predictions lack correlation with experimental affinities within dynamic ranges below 2 kcal/mol as in the case of HIV-integrase ligands, but they correctly signaled the narrowness of the dynamic range. Using a common protein structure for all ligands can reduce the noise, while incorporating a more sophisticated solvation treatment improves absolute predictions. The HIV-integrase virtual screening data set consists of promiscuous weak binders with relatively high flexibility and thus it falls outside of the applicability domain of the Wilma–SIE docking platform. Despite these difficulties, unbiased docking around three known binding sites of the enzyme resulted in over a third of ligands being docked within 2 Å from their actual poses and over half of the ligands docked in the correct site, leading to better-than-random virtual screening results.     

Combined QSAR-based virtual screening and fluorescence binding assay to identify natural product mediators of Interferon Regulatory Factor 7 (IRF-7) in pulmonary infection

Abstract

Interferon regulatory factor-7 (IRF-7) is involved in pulmonary infection and pneumonia. Here, a synthetic strategy that combined quantitative structure–activity relationship (QSAR)-based virtual screening and in vitro binding assay was described to identify new and potent mediator ligands of IRF-7 from natural products. In the procedure, a QSAR scoring function was developed and validated using Gaussian process (GP) regression and a structure-based set of protein–ligand affinity data. By integrating hotspot pocket prediction, pharmacokinetics profile analysis and molecular docking calculations, the scoring function was successfully applied to virtual screening against a large library of structurally diverse, drug-like natural products. With the method we were able to identify a number of potential hits, from which several compounds were found to have moderate or high affinity to IRF-7 using fluorescence binding assays, with dissociation constants K_d at micromolar level. We have also examined the structural basis and noncovalent interactions of computationally modelled IRF-7 complex with its potent ligands. It is revealed that hydrophobic forces and van der Waals contacts play a central role in stabilization of the complex architecture, while few hydrogen bonds confer additional specificity for the protein–ligand recognition.