Further development and validation of empirical scoring functions for structure-based binding affinity prediction

New empirical scoring functions have been developed to estimate the binding affinity of a given protein-ligand complex with known three-dimensional structure. These scoring functions include terms accounting for van der Waals interaction, hydrogen bonding, deformation penalty, and hydrophobic effect. A special feature is that three different algorithms have been implemented to calculate the hydrophobic effect term, which results in three parallel scoring functions. All three scoring functions are calibrated through multivariate regression analysis of a set of 200 protein-ligand complexes and they reproduce the binding free energies of the entire training set with standard deviations of 2.2 kcal/mol, 2.1 kcal/mol, and 2.0 kcal/mol, respectively. These three scoring functions are further combined into a consensus scoring function, X-CSCORE. When tested on an independent set of 30 protein-ligand complexes, X-CSCORE is able to predict their binding free energies with a standard deviation of 2.2 kcal/mol. The potential application of X-CSCORE to molecular docking is also investigated. Our results show that this consensus scoring function improves the docking accuracy considerably when compared to the conventional force field computation used for molecular docking.     

Development and evaluation of a generic evolutionary method for protein-ligand docking

We have developed a generic evolutionary method with an empirical scoring function for the protein-ligand docking, which is a problem of paramount importance in structure-based drug design. This approach, referred to as the GEMDOCK (Generic Evolutionary Method for molecular DOCKing), combines both continuous and discrete search mechanisms. We tested our approach on seven protein-ligand complexes, and the docked lowest energy structures have root-mean-square derivations ranging from 0.32 to 0.99 A with respect to the corresponding crystal ligand structures. In addition, we evaluated GEMDOCK on crossdocking experiments, in which some complexes with an identical protein used for docking all crystallized ligands of these complexes. GEMDOCK yielded 98% docked structures with RMSD below 2.0 A when the ligands were docked into foreign protein structures. We have reported the validation and analysis of our approach on various search spaces and scoring functions. Experimental results show that our approach is robust, and the empirical scoring function is simple and fast to recognize compounds. We found that if GEMDOCK used the RMSD scoring function, then the prediction accuracy was 100% and the docked structures had RMSD below 0.1 A for each test system. These results suggest that GEMDOCK is a useful tool, and may systematically improve the forms and parameters of a scoring function, which is one of major bottlenecks for molecular recognition.     

Ligand-specific scoring functions: improved ranking of docking solutions

Molecular docking is a powerful computational method that has been widely used in many biomolecular studies to predict geometry of a protein-ligand complex. However, while its conformational search algorithms are usually able to generate correct conformation of a ligand in the binding site, the scoring methods often fail to discriminate it among many false variants. We propose to treat this problem by applying more precise ligand-specific scoring filters to re-rank docking solutions. In this way specific features of interactions between protein and different types of compounds can be implicitly taken into account. New scoring functions were constructed including hydrogen bonds, hydrophobic and hydrophilic complementarity terms. These scoring functions also discriminate ligands by the size of the molecule, the total hydrophobicity, and the number of peptide bonds for peptide ligands. Weighting coefficients of the scoring functions were adjusted using a training set of 60 protein-ligand complexes. The proposed method was then tested on the results of docking obtained for an additional 70 complexes. In both cases the success rate was 5-8% better compared to the standard functions implemented in popular docking software.     

DrugScoreRNA--knowledge-based scoring function to predict RNA-ligand interactions

There is growing interest in RNA as a drug target due to its widespread involvement in biological processes. To exploit the power of structure-based drug-design approaches, novel scoring and docking tools need to be developed that can efficiently and reliably predict binding modes and binding affinities of RNA ligands. We report for the first time the development of a knowledge-based scoring function to predict RNA-ligand interactions (DrugScoreRNA). Based on the formalism of the DrugScore approach, distance-dependent pair potentials are derived from 670 crystallographically determined nucleic acid-ligand and -protein complexes. These potentials display quantitative differences compared to those of DrugScore (derived from protein-ligand complexes) and DrugScoreCSD (derived from small-molecule crystal data). When used as an objective function for docking 31 RNA-ligand complexes, DrugScoreRNA generates "good" binding geometries (rmsd (root mean-square deviation) < 2 A) in 42% of all cases on the first scoring rank. This is an improvement of 44% to 120% when compared to DrugScore, DrugScoreCSD, and an RNA-adapted AutoDock scoring function. Encouragingly, good docking results are also obtained for a subset of 20 NMR structures not contained in the knowledge-base to derive the potentials. This clearly demonstrates the robustness of the potentials. Binding free energy landscapes generated by DrugScoreRNA show a pronounced funnel shape in almost 3/4 of all cases, indicating the reduced steepness of the knowledge-based potentials. Docking with DrugScoreRNA can thus be expected to converge fast to the global minimum. Finally, binding affinities were predicted for 15 RNA-ligand complexes with DrugScoreRNA. A fair correlation between experimental and computed values is found (RS = 0.61), which suffices to distinguish weak from strong binders, as is required in virtual screening applications. DrugScoreRNA again shows superior predictive power when compared to DrugScore, DrugScoreCSD, and an RNA-adapted AutoDock scoring function.     

14种结合自由能评价函数的比较

采用LigandFit作为构象采样工具，以230个蛋白质-配体复合物组成的预测集，系统地比较了14种自由能评价函数（Ligscore1、Ligscore2、Plp1、Plp2、Jain、Pmf、Ludi1、Ludi2、Ludi3、D-score、Pmf-score、G-score、Chemscore以及Xscore）对蛋白质和小分子之间的结合模式以及结合自由能的预测能力. Plp1、Plp2、G-score、Pmf和Xscore在预测测试集结合自由能时得到的分数同实验测定的结合自由能的线性相关系数大于50%. 在识别配体分子实验结合构象的能力方面， 选择测试构象与实际构象间的位置均方根偏差rmsd≤0.20 nm作为评价标准，14种评价函数的成功率从46%到77%不等，其中Ligscore1、Ligscore2、Plp1、Plp2以及Xscore的成功率都在70%以上. 将评价函数中的2个或者3个组合得到一组共同评价函数可以进一步提高实验构象的预测能力， 其预测成功率可以达到80%. 实验表明Xscore、Plp1和Plp2在对接和评价方面都得到较好的结果.     

Assessing the performance of the molecular mechanics/Poisson Boltzmann surface area and molecular mechanics/generalized Born surface area methods. II. The accuracy of ranking poses generated from docking

In molecular docking, it is challenging to develop a scoring function that is accurate to conduct high-throughput screenings. Most scoring functions implemented in popular docking software packages were developed with many approximations for computational efficiency, which sacrifices the accuracy of prediction. With advanced technology and powerful computational hardware nowadays, it is feasible to use rigorous scoring functions, such as molecular mechanics/Poisson Boltzmann surface area (MM/PBSA) and molecular mechanics/generalized Born surface area (MM/GBSA) in molecular docking studies. Here, we systematically investigated the performance of MM/PBSA and MM/GBSA to identify the correct binding conformations and predict the binding free energies for 98 protein-ligand complexes. Comparison studies showed that MM/GBSA (69.4%) outperformed MM/PBSA (45.5%) and many popular scoring functions to identify the correct binding conformations. Moreover, we found that molecular dynamics simulations are necessary for some systems to identify the correct binding conformations. Based on our results, we proposed the guideline for MM/GBSA to predict the binding conformations. We then tested the performance of MM/GBSA and MM/PBSA to reproduce the binding free energies of the 98 protein-ligand complexes. The best prediction of MM/GBSA model with internal dielectric constant 2.0, produced a Spearman's correlation coefficient of 0.66, which is better than MM/PBSA (0.49) and almost all scoring functions used in molecular docking. In summary, MM/GBSA performs well for both binding pose predictions and binding free-energy estimations and is efficient to re-score the top-hit poses produced by other less-accurate scoring functions.     

The MPSim-Dock hierarchical docking algorithm: application to the eight trypsin inhibitor cocrystals

To help improve the accuracy of protein-ligand docking as a useful tool for drug discovery, we developed MPSim-Dock, which ensures a comprehensive sampling of diverse families of ligand conformations in the binding region followed by an enrichment of the good energy scoring families so that the energy scores of the sampled conformations can be reliably used to select the best conformation of the ligand. This combines elements of DOCK4.0 with molecular dynamics (MD) methods available in the software, MPSim. We test here the efficacy of MPSim-Dock to predict the 64 protein-ligand combinations formed by starting with eight trypsin cocrystals, and crossdocking the other seven ligands to each protein conformation. We consider this as a model for how well the method would work for one given target protein structure. Using as a criterion that the structures within 2 kcal/mol of the top scoring include a conformation within a coordinate root mean square (CRMS) of 1 A of the crystal structure, we find that 100% of the 64 cases are predicted correctly. This indicates that MPSim-Dock can be used reliably to identify strongly binding ligands, making it useful for virtual ligand screening.     

An iterative knowledge-based scoring function to predict protein-ligand interactions: I. Derivation of interaction potentials

Using a novel iterative method, we have developed a knowledge-based scoring function (ITScore) to predict protein-ligand interactions. The pair potentials for ITScore were derived from a training set of 786 protein-ligand complex structures in the Protein Data Bank. Twenty-six atom types were used based on the atom type category of the SYBYL software. The iterative method circumvents the long-standing reference state problem in the derivation of knowledge-based scoring functions. The basic idea is to improve pair potentials by iteration until they correctly discriminate experimentally determined binding modes from decoy ligand poses for the ligand-protein complexes in the training set. The iterative method is efficient and normally converges within 20 iterative steps. The scoring function based on the derived potentials was tested on a diverse set of 140 protein-ligand complexes for affinity prediction, yielding a high correlation coefficient of 0.74. Because ITScore uses SYBYL-defined atom types, this scoring function is easy to use for molecular files prepared by SYBYL or converted by software such as BABEL.     

A scoring function for docking ligands to low-resolution protein structures

We present a docking method that uses a scoring function for protein-ligand docking that is designed to maximize the docking success rate for low-resolution protein structures. We find that the resulting scoring function parameters are very different depending on whether they were optimized for high- or low-resolution protein structures. We show that this docking method can be successfully applied to predict the ligand-binding site of low-resolution structures. For a set of 25 protein-ligand complexes, in 76% of the cases, more than 50% of ligand-contacting residues are correctly predicted (using receptor crystal structures where the binding site is unspecified). Using decoys of the receptor structures having a 4 A RMSD from the native structure, for the same set of complexes, in 72% of the cases, we obtain at least one correctly predicted ligand-contacting residue. Furthermore, using an 81-protein-ligand set described by Jain, in 76 (93.8%) cases, the algorithm correctly predicts more than 50% of the ligand-contacting residues when native protein structures are used. Using 3 A RMSD from native decoys, in all but two cases (97.5%), the algorithm predicts at least one ligand-binding residue correctly. Finally, compared to the previously published Dolores method, for 298 protein-ligand pairs, the number of cases in which at least half of the specific contacts are correctly predicted is more than four times greater.     

Investigation of MM-PBSA rescoring of docking poses

Target-based virtual screening is increasingly used to generate leads for targets for which high quality three-dimensional (3D) structures are available. To allow large molecular databases to be screened rapidly, a tiered scoring scheme is often employed whereby a simple scoring function is used as a fast filter of the entire database and a more rigorous and time-consuming scoring function is used to rescore the top hits to produce the final list of ranked compounds. Molecular mechanics Poisson-Boltzmann surface area (MM-PBSA) approaches are currently thought to be quite effective at incorporating implicit solvation into the estimation of ligand binding free energies. In this paper, the ability of a high-throughput MM-PBSA rescoring function to discriminate between correct and incorrect docking poses is investigated in detail. Various initial scoring functions are used to generate docked poses for a subset of the CCDC/Astex test set and to dock one set of actives/inactives from the DUD data set. The effectiveness of each of these initial scoring functions is discussed. Overall, the ability of the MM-PBSA rescoring function to (i) regenerate the set of X-ray complexes when docking the bound conformation of the ligand, (ii) regenerate the X-ray complexes when docking conformationally expanded databases for each ligand which include "conformation decoys" of the ligand, and (iii) enrich known actives in a virtual screen for the mineralocorticoid receptor in the presence of "ligand decoys" is assessed. While a pharmacophore-based molecular docking approach, PhDock, is used to carry out the docking, the results are expected to be general to use with any docking method.     

Accelerating molecular docking calculations using graphics processing units

The generation of molecular conformations and the evaluation of interaction potentials are common tasks in molecular modeling applications, particularly in protein-ligand or protein-protein docking programs. In this work, we present a GPU-accelerated approach capable of speeding up these tasks considerably. For the evaluation of interaction potentials in the context of rigid protein-protein docking, the GPU-accelerated approach reached speedup factors of up to over 50 compared to an optimized CPU-based implementation. Treating the ligand and donor groups in the protein binding site as flexible, speedup factors of up to 16 can be observed in the evaluation of protein-ligand interaction potentials. Additionally, we introduce a parallel version of our protein-ligand docking algorithm PLANTS that can take advantage of this GPU-accelerated scoring function evaluation. We compared the GPU-accelerated parallel version to the same algorithm running on the CPU and also to the highly optimized sequential CPU-based version. In terms of dependence of the ligand size and the number of rotatable bonds, speedup factors of up to 10 and 7, respectively, can be observed. Finally, a fitness landscape analysis in the context of rigid protein-protein docking was performed. Using a systematic grid-based search methodology, the GPU-accelerated version outperformed the CPU-based version with speedup factors of up to 60.     

Novel, customizable scoring functions, parameterized using N-PLS, for structure-based drug discovery

The ability to accurately predict biological affinity on the basis of in silico docking to a protein target remains a challenging goal in the CADD arena. Typically, "standard" scoring functions have been employed that use the calculated docking result and a set of empirical parameters to calculate a predicted binding affinity. To improve on this, we are exploring novel strategies for rapidly developing and tuning "customized" scoring functions tailored to a specific need. In the present work, three such customized scoring functions were developed using a set of 129 high-resolution protein-ligand crystal structures with measured Ki values. The functions were parametrized using N-PLS (N-way partial least squares), a multivariate technique well-known in the 3D quantitative structure-activity relationship field. A modest correlation between observed and calculated pKi values using a standard scoring function (r2 = 0.5) could be improved to 0.8 when a customized scoring function was applied. To mimic a more realistic scenario, a second scoring function was developed, not based on crystal structures but exclusively on several binding poses generated with the Flo+ docking program. Finally, a validation study was conducted by generating a third scoring function with 99 randomly selected complexes from the 129 as a training set and predicting pKi values for a test set that comprised the remaining 30 complexes. Training and test set r2 values were 0.77 and 0.78, respectively. These results indicate that, even without direct structural information, predictive customized scoring functions can be developed using N-PLS, and this approach holds significant potential as a general procedure for predicting binding affinity on the basis of in silico docking.     

Ligand-specific scoring functions: improved ranking of docking solutions1

Molecular docking is a powerful computational method that has been widely used in many biomolecular studies to predict geometry of a protein-ligand complex. However, while its conformational search algorithms are usually able to generate correct conformation of a ligand in the binding site, the scoring methods often fail to discriminate it among many false variants. We propose to treat this problem by applying more precise ligand-specific scoring filters to re-rank docking solutions. In this way specific features of interactions between protein and different types of compounds can be implicitly taken into account. New scoring functions were constructed including hydrogen bonds, hydrophobic and hydrophilic complementarity terms. These scoring functions also discriminate ligands by the size of the molecule, the total hydrophobicity, and the number of peptide bonds for peptide ligands. Weighting coefficients of the scoring functions were adjusted using a training set of 60 protein–ligand complexes. The proposed method was then tested on the results of docking obtained for an additional 70 complexes. In both cases the success rate was 5–8% better compared to the standard functions implemented in popular docking software.     

Novel ligands for a purine riboswitch discovered by RNA-ligand docking

The increasing number of RNA crystal structures enables a structure-based approach to the discovery of new RNA-binding ligands. To develop the poorly explored area of RNA-ligand docking, we have conducted a virtual screening exercise for a purine riboswitch to probe the strengths and weaknesses of RNA-ligand docking. Using a standard protein-ligand docking program with only minor modifications, four new ligands with binding affinities in the micromolar range were identified, including two compounds based on molecular scaffolds not resembling known ligands. RNA-ligand docking performed comparably to protein-ligand docking indicating that this approach is a promising option to explore the wealth of RNA structures for structure-based ligand design.     

A QXP-based multistep docking procedure for accurate prediction of protein-ligand complexes

The two great challenges of the docking process are the prediction of ligand poses in a protein binding site and the scoring of the docked poses. Ligands that are composed of extended chains in their molecular structure display the most difficulties, predominantly because of the torsional flexibility. On the basis of the molecular docking program QXP-Flo+0802, we have developed a procedure particularly for ligands with a high degree of rotational freedom that allows the accurate prediction of the orientation and conformation of ligands in protein binding sites. Starting from an initial full Monte Carlo docking experiment, this was achieved by performing a series of successive multistep docking runs using a local Monte Carlo search with a restricted rotational angle, by which the conformational search space is limited. The method was established by using a highly flexible acetylcholinesterase inhibitor and has been applied to a number of challenging protein-ligand complexes known from the literature.     

TreeDock: a tool for protein docking based on minimizing van der Waals energies

Predicting protein-protein and protein-ligand docking remains one of the challenging topics of structural biology. The main problems are (i) to reliably estimate the binding free energies of docked states, (ii) to enumerate possible docking orientations at a high resolution, and (iii) to consider mobility of the docking surfaces and structural rearrangements upon interaction. Here we present a novel algorithm, TreeDock, that addresses the enumeration problem in a rigid-body docking search. By representing molecules as multidimensional binary search trees and by exploring a sufficient number of docking orientations such that two chosen atoms, one from each molecule, are always in contact, TreeDock is able to explore all clash-free orientations at very fine resolution in a reasonable amount of time. Due to the speed of the program, many contact pairs can be examined to search partial or complete surface areas. The deterministic systematic search of TreeDock is in contrast to most other docking programs that use stochastic searches such as Monte Carlo or simulated annealing methods. At this point, we have used the Lennard-Jones potential as the only scoring function and show that this can predict the correct docked conformation for a number of protein-protein and protein-ligand complexes. The program is most powerful if some information is known about the location of binding faces from NMR chemical-shift perturbation studies, orientation information from residual dipolar coupling, or mutational screening. The approach has the potential to include docking-site mobility by performing molecular dynamics or other randomization methods of the docking site and docking families to families of structures. The performance of the algorithm is demonstrated by docking three complexes of immunoglobulin superfamily domains, CD2 to CD58, the V(alpha) domain of a T-cell receptor to its V(beta) domain, and a T-cell receptor to a pMHC complex as well as a small molecule inhibitor to a phosphatase.     

Supervised consensus scoring for docking and virtual screening

Docking programs are widely used to discover novel ligands efficiently and can predict protein-ligand complex structures with reasonable accuracy and speed. However, there is an emerging demand for better performance from the scoring methods. Consensus scoring (CS) methods improve the performance by compensating for the deficiencies of each scoring function. However, conventional CS and existing scoring functions have the same problems, such as a lack of protein flexibility, inadequate treatment of salvation, and the simplistic nature of the energy function used. Although there are many problems in current scoring functions, we focus our attention on the incorporation of unbound ligand conformations. To address this problem, we propose supervised consensus scoring (SCS), which takes into account protein-ligand binding process using unbound ligand conformations with supervised learning. An evaluation of docking accuracy for 100 diverse protein-ligand complexes shows that SCS outperforms both CS and 11 scoring functions (PLP, F-Score, LigScore, DrugScore, LUDI, X-Score, AutoDock, PMF, G-Score, ChemScore, and D-score). The success rates of SCS range from 89% to 91% in the range of rmsd < 2 A, while those of CS range from 80% to 85%, and those of the scoring functions range from 26% to 76%. Moreover, we also introduce a method for judging whether a compound is active or inactive with the appropriate criterion for virtual screening. SCS performs quite well in docking accuracy and is presumably useful for screening large-scale compound databases before predicting binding affinity.