Comparative assessment of scoring functions on an updated benchmark: 1. Compilation of the test set

Development of a new benchmark for assessing the scoring functions applicable to protein–protein interactions

Aim: Scoring functions are important component of protein–protein docking methods. They need to be evaluated on high-quality benchmarks to reveal their strengths and weaknesses. Evaluation results obtained on such benchmarks can provide valuable guidance for developing more advanced scoring functions. Methodology & results: In our comparative assessment of scoring functions for protein–protein interactions benchmark, the performance of a scoring function was characterized by ‘docking power’ and ‘scoring power’. A high-quality dataset of 273 protein–protein complexes was compiled and employed in both tests. Four scoring functions, including FASTCONTACT, ZRANK, dDFIRE and ATTRACT were tested as demonstration. ZRANK and ATTRACT exhibited encouraging performance in the docking power test. However, all four scoring functions failed badly in the scoring power test. Conclusion: Our comparative assessment of scoring functions for protein–protein interaction benchmark is created especially for assessing the scoring functions applicable to protein–protein interactions. It is different from other benchmarks for assessing protein–protein docking methods. Our benchmark is available to the public at www.pdbbind-cn.org/download/CASF-PPI/ .

A Diverse Benchmark Based on 3D Matched Molecular Pairs for Validating Scoring Functions

The prediction of protein-ligand interactions and their corresponding binding free energy is a challenging task in structure-based drug design and related applications. Docking and scoring is broadly used to propose the binding mode and underlying interactions as well as to provide a measure for ligand affinity or differentiate between active and inactive ligands. Various studies have revealed that most docking software packages reliably predict the binding mode, although scoring remains a challenge. Here, a diverse benchmark data set of 99 matched molecular pairs (3D-MMPs) with experimentally determined X-ray structures and corresponding binding affinities is introduced. This data set was used to study the predictive power of 13 commonly used scoring functions to demonstrate the applicability of the 3D-MMP data set as a valuable tool for benchmarking scoring functions.

Predictive Power of Different Types of Experimental Restraints in Small Molecule Docking: A Review

Incorporating experimental restraints is a powerful method of increasing accuracy in computational protein small molecule docking simulations. Different algorithms integrate distinct forms of biochemical data during the docking and/or scoring stages. These so-called hybrid methods make use of receptor-based information such as nuclear magnetic resonance (NMR) restraints or small molecule-based information such as structure-activity relationships (SARs). A third class of methods directly interrogates contacts between the protein receptor and the small molecule. This work reviews the current state of using such restraints in docking simulations, evaluates their feasibility across broad systems, and identifies potential areas of algorithm development.

Exploring Structure-Activity Relationships with Three-Dimensional Matched Molecular Pairs-A Review

A matched molecular pair (MMP) consists of two small molecules that differ by a few atoms only. The minor structural difference between the molecules allows a detailed analysis of changes in properties. Three-dimensional (3D) MMPs extend the concept of chemical similarity by spatial similarity. Conformations must be generated, and superimpositions have to be calculated. The additional complexity and uncertainty as well as the smaller amount of available experimental data substantially complicates the derivation of models. Nonetheless, there are some benefits that make the transition worthwhile. The 3D concept gives detailed insight into mechanisms behind several methods classically used by the 2D MMP approach. It can help to analyze disrupted series of structure-activity relationships or extend the 2D MMP concept with scaffold hopping. One of the most powerful features is the high confidence structure-activity relationship transfer between series of analogues. Several research groups have approached the problem from different directions. The models vary especially in the 3D similarity measure used and complexity of the applied descriptor selected or designed. Nonetheless, all approaches have increased the amount of information available by incorporating 3D structural information.

Protein-ligand docking using FFT based sampling: D3R case study

Fast Fourier transform (FFT) based approaches have been successful in application to modeling of relatively rigid protein-protein complexes. Recently, we have been able to adapt the FFT methodology to treatment of flexible protein-peptide interactions. Here, we report our latest attempt to expand the capabilities of the FFT approach to treatment of flexible protein-ligand interactions in application to the D3R PL-2016-1 challenge. Based on the D3R assessment, our FFT approach in conjunction with Monte Carlo minimization off-grid refinement was among the top performing methods in the challenge. The potential advantage of our method is its ability to globally sample the protein-ligand interaction landscape, which will be explored in further applications.

Applications of the NRGsuite and the Molecular Docking Software FlexAID in Computational Drug Discovery and Design

Docking simulations help us understand molecular interactions. Here we present a hands-on tutorial to utilize FlexAID (Flexible Artificial Intelligence Docking), an open source molecular docking software between ligands such as small molecules or peptides and macromolecules such as proteins and nucleic acids. The tutorial uses the NRGsuite PyMOL plugin graphical user interface to set up and visualize docking simulations in real time as well as detect and refine target cavities. The ease of use of FlexAID and the NRGsuite combined with its superior performance relative to widely used docking software provides nonexperts with an important tool to understand molecular interactions with direct applications in structure-based drug design and virtual high-throughput screening.

Workflows and performances in the ranking prediction of 2016 D3R Grand Challenge 2: lessons learned from a collaborative effort

The 2016 D3R Grand Challenge 2 includes both pose and affinity or ranking predictions. This article is focused exclusively on affinity predictions submitted to the D3R challenge from a collaborative effort of the modeling and informatics group. Our submissions include ranking of 102 ligands covering 4 different chemotypes against the FXR ligand binding domain structure, and the relative binding affinity predictions of the two designated free energy subsets of 15 and 18 compounds. Using all the complex structures prepared in the same way allowed us to cover many types of workflows and compare their performances effectively. We evaluated typical workflows used in our daily structure-based design modeling support, which include docking scores, force field-based scores, QM/MM, MMGBSA, MD-MMGBSA, and MacroModel interaction energy estimations. The best performing methods for the two free energy subsets are discussed. Our results suggest that affinity ranking still remains very challenging; that the knowledge of more structural information does not necessarily yield more accurate predictions; and that visual inspection and human intervention are considerably important for ranking. Knowledge of the mode of action and protein flexibility along with visualization tools that depict polar and hydrophobic maps are very useful for visual inspection. QM/MM-based workflows were found to be powerful in affinity ranking and are encouraged to be applied more often. The standardized input and output enable systematic analysis and support methodology development and improvement for high level blinded predictions.

Estimating Electron Density Support for Individual Atoms and Molecular Fragments in X-ray Structures

Macromolecular structures resolved by X-ray crystallography are essential for life science research. While some methods exist to automatically quantify the quality of the electron density fit, none of them is without flaws. Especially the question of how well individual parts like atoms, small fragments, or molecules are supported by electron density is difficult to quantify. While taking experimental uncertainties correctly into account, they do not offer an answer on how reliable an individual atom position is. A rapid quantification of this atomic position reliability would be highly valuable in structure-based molecular design. To overcome this limitation, we introduce the electron density score EDIA for individual atoms and molecular fragments. EDIA assesses rapidly, automatically, and intuitively the fit of individual as well as multiple atoms (EDIA_m) into electron density accompanied by an integrated error analysis. The computation is based on the standard 2fo - fc electron density map in combination with the model of the molecular structure. For evaluating partial structures, EDIA_m shows significant advantages compared to the real-space R correlation coefficient (RSCC) and the real-space difference density Z score (RSZD) from the molecular modeler's point of view. Thus, EDIA abolishes the time-consuming step of visually inspecting the electron density during structure selection and curation. It supports daily modeling tasks of medicinal and computational chemists and enables a fully automated assembly of large-scale, high-quality structure data sets. Furthermore, EDIA scores can be applied for model validation and method development in computer-aided molecular design. In contrast to measuring the deviation from the structure model by root-mean-squared deviation, EDIA scores allow comparison to the underlying experimental data taking its uncertainty into account.

Superior Performance of the SQM/COSMO Scoring Functions in Native Pose Recognition of Diverse Protein-Ligand Complexes in Cognate Docking

General and reliable description of structures and energetics in protein-ligand (PL) binding using the docking/scoring methodology has until now been elusive. We address this urgent deficiency of scoring functions (SFs) by the systematic development of corrected semiempirical quantum mechanical (SQM) methods, which correctly describe all types of noncovalent interactions and are fast enough to treat systems of thousands of atoms. Two most accurate SQM methods, PM6-D3H4X and SCC-DFTB3-D3H4X, are coupled with the conductor-like screening model (COSMO) implicit solvation model in so-called "SQM/COSMO" SFs and have shown unique recognition of native ligand poses in cognate docking in four challenging PL systems, including metalloprotein. Here, we apply the two SQM/COSMO SFs to 17 diverse PL complexes and compare their performance with four widely used classical SFs (Glide XP, AutoDock4, AutoDock Vina, and UCSF Dock). We observe superior performance of the SQM/COSMO SFs and identify challenging systems. This method, due to its generality, comparability across the chemical space, and lack of need for any system-specific parameters, gives promise of becoming, after comprehensive large-scale testing in the near future, a useful computational tool in structure-based drug design and serving as a reference method for the development of other SFs.

Enhance the performance of current scoring functions with the aid of 3D protein-ligand interaction fingerprints

BACKGROUND

In structure-based drug design, binding affinity prediction remains as a challenging goal for current scoring functions. Development of target-biased scoring functions provides a new possibility for tackling this problem, but this approach is also associated with certain technical difficulties. We previously reported the Knowledge-Guided Scoring (KGS) method as an alternative approach (BMC Bioinformatics, 2010, 11, 193-208). The key idea is to compute the binding affinity of a given protein-ligand complex based on the known binding data of an appropriate reference complex, so the error in binding affinity prediction can be reduced effectively.

RESULTS

In this study, we have developed an upgraded version, i.e. KGS2, by employing 3D protein-ligand interaction fingerprints in reference selection. KGS2 was evaluated in combination with four scoring functions (X-Score, ChemPLP, ASP, and GoldScore) on five drug targets (HIV-1 protease, carbonic anhydrase 2, beta-secretase 1, beta-trypsin, and checkpoint kinase 1). In the in situ scoring test, considerable improvements were observed in most cases after application of KGS2. Besides, the performance of KGS2 was always better than KGS in all cases. In the more challenging molecular docking test, application of KGS2 also led to improved structure-activity relationship in some cases.

CONCLUSIONS

KGS2 can be applied as a convenient "add-on" to current scoring functions without the need to re-engineer them, and its application is not limited to certain target proteins as customized scoring functions. As an interpolation method, its accuracy in principle can be improved further with the increasing knowledge of protein-ligand complex structures and binding affinity data. We expect that KGS2 will become a practical tool for enhancing the performance of current scoring functions in binding affinity prediction. The KGS2 software is available upon contacting the authors.

Effect of sampling on BACE-1 ligands binding free energy predictions via MM-PBSA calculations

The BACE-1 enzyme is a prime target to find a cure to Alzheimer's disease. In this article, we used the MM-PBSA approach to compute the binding free energies of 46 reported ligands to this enzyme. After showing that the most probable protonation state of the catalytic dyad is mono-protonated (on ASP32), we performed a thorough analysis of the parameters influencing the sampling of the conformational space (in total, more than 35 μs of simulations were performed). We show that ten simulations of 2 ns gives better results than one of 50 ns. We also investigated the influence of the protein force field, the water model, the periodic boundary conditions artifacts (box size), as well as the ionic strength. Amber03 with TIP3P, a minimal distance of 1.0 nm between the protein and the box edges and a ionic strength of I = 0.2 M provides the optimal correlation with experiments. Overall, when using these parameters, a Pearson correlation coefficient of R = 0.84 (R²  = 0.71) is obtained for the 46 ligands, spanning eight orders of magnitude of K_d (from 0.017 nm to 2000 μM, i.e., from -14.7 to -3.7 kcal/mol), with a ligand size from 22 to 136 atoms (from 138 to 937 g/mol). After a two-parameter fit of the binding affinities for 12 of the ligands, an error of RMSD = 1.7 kcal/mol was obtained for the remaining ligands. © 2017 Wiley Periodicals, Inc.

Forging the Basis for Developing Protein-Ligand Interaction Scoring Functions

In structure-based drug design, scoring functions are widely used for fast evaluation of protein-ligand interactions. They are often applied in combination with molecular docking and de novo design methods. Since the early 1990s, a whole spectrum of protein-ligand interaction scoring functions have been developed. Regardless of their technical difference, scoring functions all need data sets combining protein-ligand complex structures and binding affinity data for parametrization and validation. However, data sets of this kind used to be rather limited in terms of size and quality. On the other hand, standard metrics for evaluating scoring function used to be ambiguous. Scoring functions are often tested in molecular docking or even virtual screening trials, which do not directly reflect the genuine quality of scoring functions. Collectively, these underlying obstacles have impeded the invention of more advanced scoring functions. In this Account, we describe our long-lasting efforts to overcome these obstacles, which involve two related projects. On the first project, we have created the PDBbind database. It is the first database that systematically annotates the protein-ligand complexes in the Protein Data Bank (PDB) with experimental binding data. This database has been updated annually since its first public release in 2004. The latest release (version 2016) provides binding data for 16 179 biomolecular complexes in PDB. Data sets provided by PDBbind have been applied to many computational and statistical studies on protein-ligand interaction and various subjects. In particular, it has become a major data resource for scoring function development. On the second project, we have established the Comparative Assessment of Scoring Functions (CASF) benchmark for scoring function evaluation. Our key idea is to decouple the "scoring" process from the "sampling" process, so scoring functions can be tested in a relatively pure context to reflect their quality. In our latest work on this track, i.e. CASF-2013, the performance of a scoring function was quantified in four aspects, including "scoring power", "ranking power", "docking power", and "screening power". All four performance tests were conducted on a test set containing 195 high-quality protein-ligand complexes selected from PDBbind. A panel of 20 standard scoring functions were tested as demonstration. Importantly, CASF is designed to be an open-access benchmark, with which scoring functions developed by different researchers can be compared on the same grounds. Indeed, it has become a popular choice for scoring function validation in recent years. Despite the considerable progress that has been made so far, the performance of today's scoring functions still does not meet people's expectations in many aspects. There is a constant demand for more advanced scoring functions. Our efforts have helped to overcome some obstacles underlying scoring function development so that the researchers in this field can move forward faster. We will continue to improve the PDBbind database and the CASF benchmark in the future to keep them as useful community resources.

High-Quality Dataset of Protein-Bound Ligand Conformations and Its Application to Benchmarking Conformer Ensemble Generators

We developed a cheminformatics pipeline for the fully automated selection and extraction of high-quality protein-bound ligand conformations from X-ray structural data. The pipeline evaluates the validity and accuracy of the 3D structures of small molecules according to multiple criteria, including their fit to the electron density and their physicochemical and structural properties. Using this approach, we compiled two high-quality datasets from the Protein Data Bank (PDB): a comprehensive dataset and a diversified subset of 4626 and 2912 structures, respectively. The datasets were applied to benchmarking seven freely available conformer ensemble generators: Balloon (two different algorithms), the RDKit standard conformer ensemble generator, the Experimental-Torsion basic Knowledge Distance Geometry (ETKDG) algorithm, Confab, Frog2 and Multiconf-DOCK. Substantial differences in the performance of the individual algorithms were observed, with RDKit and ETKDG generally achieving a favorable balance of accuracy, ensemble size and runtime. The Platinum datasets are available for download from http://www.zbh.uni-hamburg.de/platinum_dataset .

Improving scoring-docking-screening powers of protein-ligand scoring functions using random forest

The development of new protein-ligand scoring functions using machine learning algorithms, such as random forest, has been of significant interest. By efficiently utilizing expanded feature sets and a large set of experimental data, random forest based scoring functions (RFbScore) can achieve better correlations to experimental protein-ligand binding data with known crystal structures; however, more extensive tests indicate that such enhancement in scoring power comes with significant under-performance in docking and screening power tests compared to traditional scoring functions. In this work, to improve scoring-docking-screening powers of protein-ligand docking functions simultaneously, we have introduced a Δvina RF parameterization and feature selection framework based on random forest. Our developed scoring function Δvina RF20 , which employs 20 descriptors in addition to the AutoDock Vina score, can achieve superior performance in all power tests of both CASF-2013 and CASF-2007 benchmarks compared to classical scoring functions. The Δvina RF20 scoring function and its code are freely available on the web at: https://www.nyu.edu/projects/yzhang/DeltaVina. © 2016 Wiley Periodicals, Inc.

A Thoroughly Validated Virtual Screening Strategy for Discovery of Novel HDAC3 Inhibitors

Histone deacetylase 3 (HDAC3) has been recently identified as a potential target for the treatment of cancer and other diseases, such as chronic inflammation, neurodegenerative diseases, and diabetes. Virtual screening (VS) is currently a routine technique for hit identification, but its success depends on rational development of VS strategies. To facilitate this process, we applied our previously released benchmarking dataset, i.e., MUBD-HDAC3 to the evaluation of structure-based VS (SBVS) and ligand-based VS (LBVS) combinatorial approaches. We have identified FRED (Chemgauss4) docking against a structural model of HDAC3, i.e., SAHA-3 generated by a computationally inexpensive “flexible docking”, as the best SBVS approach and a common feature pharmacophore model, i.e., Hypo1 generated by Catalyst/HipHop as the optimal model for LBVS. We then developed a pipeline that was composed of Hypo1, FRED (Chemgauss4), and SAHA-3 sequentially, and demonstrated that it was superior to other combinations in terms of ligand enrichment. In summary, we present the first highly-validated, rationally-designed VS strategy specific to HDAC3 inhibitor discovery. The constructed pipeline is publicly accessible for the scientific community to identify novel HDAC3 inhibitors in a time-efficient and cost-effective way.

Exploring the stability of ligand binding modes to proteins by molecular dynamics simulations

The binding mode prediction is of great importance to structure-based drug design. The discrimination of various binding poses of ligand generated by docking is a great challenge not only to docking score functions but also to the relatively expensive free energy calculation methods. Here we systematically analyzed the stability of various ligand poses under molecular dynamics (MD) simulation. First, a data set of 120 complexes was built based on the typical physicochemical properties of drug-like ligands. Three potential binding poses (one correct pose and two decoys) were selected for each ligand from self-docking in addition to the experimental pose. Then, five independent MD simulations for each pose were performed with different initial velocities for the statistical analysis. Finally, the stabilities of ligand poses under MD were evaluated and compared with the native one from crystal structure. We found that about 94% of the native poses were maintained stable during the simulations, which suggests that MD simulations are accurate enough to judge most experimental binding poses as stable properly. Interestingly, incorrect decoy poses were maintained much less and 38-44% of decoys could be excluded just by performing equilibrium MD simulations, though 56-62% of decoys were stable. The computationally-heavy binding free energy calculation can be performed only for these survived poses.

Prediction of N-Methyl-D-Aspartate Receptor GluN1-Ligand Binding Affinity by a Novel SVM-Pose/SVM-Score Combinatorial Ensemble Docking Scheme

The glycine-binding site of the N-methyl-D-aspartate receptor (NMDAR) subunit GluN1 is a potential pharmacological target for neurodegenerative disorders. A novel combinatorial ensemble docking scheme using ligand and protein conformation ensembles and customized support vector machine (SVM)-based models to select the docked pose and to predict the docking score was generated for predicting the NMDAR GluN1-ligand binding affinity. The predicted root mean square deviation (RMSD) values in pose by SVM-Pose models were found to be in good agreement with the observed values (n = 30, r² = 0.928–0.988,  = 0.894–0.954, RMSE = 0.002–0.412, s = 0.001–0.214), and the predicted pK_i values by SVM-Score were found to be in good agreement with the observed values for the training samples (n = 24, r² = 0.967,  = 0.899, RMSE = 0.295, s = 0.170) and test samples (n = 13, q² = 0.894, RMSE = 0.437, s = 0.202). When subjected to various statistical validations, the developed SVM-Pose and SVM-Score models consistently met the most stringent criteria. A mock test asserted the predictivity of this novel docking scheme. Collectively, this accurate novel combinatorial ensemble docking scheme can be used to predict the NMDAR GluN1-ligand binding affinity for facilitating drug discovery.

Scoring Functions of Protein-Ligand Interactions

Scoring function of protein-ligand interactions is used to recognize the “native” binding pose of a ligand on the protein and to predict the binding affinity, so that the active small molecules can be discriminated from the non-active ones. Scoring function is widely used in computationally molecular docking and structure-based drug discovery. The development and improvement of scoring functions have broad implications in pharmaceutical industry and academic research. During the past three decades, much progress have been made in methodology and accuracy for scoring functions, and many successful cases have be witnessed in virtual database screening. In this chapter, the authors introduced the basic types of scoring functions and their derivations, the commonly-used evaluation methods and benchmarks, as well as the underlying challenges and current solutions. Finally, the authors discussed the promising directions to improve and develop scoring functions for future molecular docking-based drug discovery.

PL-PatchSurfer2: Improved Local Surface Matching-Based Virtual Screening Method That Is Tolerant to Target and Ligand Structure Variation

Virtual screening has become an indispensable procedure in drug discovery. Virtual screening methods can be classified into two categories: ligand-based and structure-based. While the former have advantages, including being quick to compute, in general they are relatively weak at discovering novel active compounds because they use known actives as references. On the other hand, structure-based methods have higher potential to find novel compounds because they directly predict the binding affinity of a ligand in a target binding pocket, albeit with substantially lower speed than ligand-based methods. Here we report a novel structure-based virtual screening method, PL-PatchSurfer2. In PL-PatchSurfer2, protein and ligand surfaces are represented by a set of overlapping local patches, each of which is represented by three-dimensional Zernike descriptors (3DZDs). By means of 3DZDs, the shapes and physicochemical complementarities of local surface regions of a pocket surface and a ligand molecule can be concisely and effectively computed. Compared with the previous version of the program, the performance of PL-PatchSurfer2 is substantially improved by the addition of two more features, atom-based hydrophobicity and hydrogen-bond acceptors and donors. Benchmark studies showed that PL-PatchSurfer2 performed better than or comparable to popular existing methods. Particularly, PL-PatchSurfer2 significantly outperformed existing methods when apo-form or template-based protein models were used for queries. The computational time of PL-PatchSurfer2 is about 20 times shorter than those of conventional structure-based methods. The PL-PatchSurfer2 program is available at http://www.kiharalab.org/plps2/ .

GeauxDock: Accelerating Structure-Based Virtual Screening with Heterogeneous Computing

Computational modeling of drug binding to proteins is an integral component of direct drug design. Particularly, structure-based virtual screening is often used to perform large-scale modeling of putative associations between small organic molecules and their pharmacologically relevant protein targets. Because of a large number of drug candidates to be evaluated, an accurate and fast docking engine is a critical element of virtual screening. Consequently, highly optimized docking codes are of paramount importance for the effectiveness of virtual screening methods. In this communication, we describe the implementation, tuning and performance characteristics of GeauxDock, a recently developed molecular docking program. GeauxDock is built upon the Monte Carlo algorithm and features a novel scoring function combining physics-based energy terms with statistical and knowledge-based potentials. Developed specifically for heterogeneous computing platforms, the current version of GeauxDock can be deployed on modern, multi-core Central Processing Units (CPUs) as well as massively parallel accelerators, Intel Xeon Phi and NVIDIA Graphics Processing Unit (GPU). First, we carried out a thorough performance tuning of the high-level framework and the docking kernel to produce a fast serial code, which was then ported to shared-memory multi-core CPUs yielding a near-ideal scaling. Further, using Xeon Phi gives 1.9× performance improvement over a dual 10-core Xeon CPU, whereas the best GPU accelerator, GeForce GTX 980, achieves a speedup as high as 3.5×. On that account, GeauxDock can take advantage of modern heterogeneous architectures to considerably accelerate structure-based virtual screening applications. GeauxDock is open-sourced and publicly available at www.brylinski.org/geauxdock and https://figshare.com/articles/geauxdock_tar_gz/3205249.

Empirical Scoring Functions for Affinity Prediction of Protein-ligand Complexes

The ability to rapidly assess the quality of a protein-ligand complex in terms of its affinity is of fundamental importance for various methods of computer-aided drug design. While simple filtering or matching critieria may be sufficient in fast docking methods or at early stages of virtual screening, estimates of the actual free energy of binding are needed whenever refined docking solutions, ligand rankings or support for the optimization of hit compounds are required. If rigorous free energy calculations based on molecular simulations are impractical, such affinity estimates are provided by scoring functions. The class of empirical scoring functions aims to provide them via a regression-based approach. Using experimental structures and affinity data of protein-ligand complexes and descriptors suitable to capture the essential features of the interaction, these functions are trained with classical linear regression techniques or machine-learning methods. The latter have led to considerable improvements in terms of prediction accuracy for large generic data sets. Nevertheless, many limitations are not yet resolved and pose significant challenges for future developments.

CSM-lig: a web server for assessing and comparing protein-small molecule affinities

Determining the affinity of a ligand for a given protein is a crucial component of drug development and understanding their biological effects. Predicting binding affinities is a challenging and difficult task, and despite being regarded as poorly predictive, scoring functions play an important role in the analysis of molecular docking results. Here, we present CSM-Lig (http://structure.bioc.cam.ac.uk/csm_lig), a web server tailored to predict the binding affinity of a protein-small molecule complex, encompassing both protein and small-molecule complementarity in terms of shape and chemistry via graph-based structural signatures. CSM-Lig was trained and evaluated on different releases of the PDBbind databases, achieving a correlation of up to 0.86 on 10-fold cross validation and 0.80 in blind tests, performing as well as or better than other widely used methods. The web server allows users to rapidly and automatically predict binding affinities of collections of structures and assess the interactions made. We believe CSM-lig would be an invaluable tool for helping assess docking poses, the effects of multiple mutations, including insertions, deletions and alternative splicing events, in protein-small molecule affinity, unraveling important aspects that drive protein–compound recognition.

Comprehensive evaluation of ten docking programs on a diverse set of protein-ligand complexes: the prediction accuracy of sampling power and scoring power

As one of the most popular computational approaches in modern structure-based drug design, molecular docking can be used not only to identify the correct conformation of a ligand within the target binding pocket but also to estimate the strength of the interaction between a target and a ligand. Nowadays, as a variety of docking programs are available for the scientific community, a comprehensive understanding of the advantages and limitations of each docking program is fundamentally important to conduct more reasonable docking studies and docking-based virtual screening. In the present study, based on an extensive dataset of 2002 protein-ligand complexes from the PDBbind database (version 2014), the performance of ten docking programs, including five commercial programs (LigandFit, Glide, GOLD, MOE Dock, and Surflex-Dock) and five academic programs (AutoDock, AutoDock Vina, LeDock, rDock, and UCSF DOCK), was systematically evaluated by examining the accuracies of binding pose prediction (sampling power) and binding affinity estimation (scoring power). Our results showed that GOLD and LeDock had the best sampling power (GOLD: 59.8% accuracy for the top scored poses; LeDock: 80.8% accuracy for the best poses) and AutoDock Vina had the best scoring power (rp/rs of 0.564/0.580 and 0.569/0.584 for the top scored poses and best poses), suggesting that the commercial programs did not show the expected better performance than the academic ones. Overall, the ligand binding poses could be identified in most cases by the evaluated docking programs but the ranks of the binding affinities for the entire dataset could not be well predicted by most docking programs. However, for some types of protein families, relatively high linear correlations between docking scores and experimental binding affinities could be achieved. To our knowledge, this study has been the most extensive evaluation of popular molecular docking programs in the last five years. It is expected that our work can offer useful information for the successful application of these docking tools to different requirements and targets.

Application of Shape Similarity in Pose Selection and Virtual Screening in CSARdock2014 Exercise

To evaluate the applicability of shape similarity in docking-based pose selection and virtual screening, we participated in the CSARdock2014 benchmark exercise for identifying the correct docking pose of inhibitors targeting factor XA, spleen tyrosine kinase, and tRNA methyltransferase. This exercise provides a valuable opportunity for researchers to test their docking programs, methods, and protocols in a blind testing environment. In the CSARdock2014 benchmark exercise, we have implemented an approach that uses ligand 3D shape similarity to facilitate docking-based pose selection and virtual screening. We showed here that ligand 3D shape similarity between bound poses could be used to identify the native-like pose from an ensemble of docking-generated poses. Our method correctly identified the native pose as the top-ranking pose for 73% of test cases in a blind testing environment. Moreover, the pose selection results also revealed an excellent correlation between ligand 3D shape similarity scores and RMSD to X-ray crystal structure ligand. In the virtual screening exercise, the average RMSD for our pose prediction was found to be 1.02 Å, and it was one of the top performances achieved in CSARdock2014 benchmark exercise. Furthermore, the inclusion of shape similarity improved virtual screening performance of docking-based scoring and ranking. The coefficient of determination (r(2)) between experimental activities and docking scores for 276 spleen tyrosine kinase inhibitors was found to be 0.365 but reached 0.614 when the ligand 3D shape similarity was included.

Optimizing the affinity and specificity of ligand binding with the inclusion of solvation effect

Solvation effect is an important factor for protein-ligand binding in aqueous water. Previous scoring function of protein-ligand interactions rarely incorporates the solvation model into the quantification of protein-ligand interactions, mainly due to the immense computational cost, especially in the structure-based virtual screening, and nontransferable application of independently optimized atomic solvation parameters. In order to overcome these barriers, we effectively combine knowledge-based atom-pair potentials and the atomic solvation energy of charge-independent implicit solvent model in the optimization of binding affinity and specificity. The resulting scoring functions with optimized atomic solvation parameters is named as specificity and affinity with solvation effect (SPA-SE). The performance of SPA-SE is evaluated and compared to 20 other scoring functions, as well as SPA. The comparative results show that SPA-SE outperforms all other scoring functions in binding affinity prediction and "native" pose identification. Our optimization validates that solvation effect is an important regulator to the stability and specificity of protein-ligand binding. The development strategy of SPA-SE sets an example for other scoring function to account for the solvation effect in biomolecular recognitions.

Low-Quality Structural and Interaction Data Improves Binding Affinity Prediction via Random Forest

Docking scoring functions can be used to predict the strength of protein-ligand binding. It is widely believed that training a scoring function with low-quality data is detrimental for its predictive performance. Nevertheless, there is a surprising lack of systematic validation experiments in support of this hypothesis. In this study, we investigated to which extent training a scoring function with data containing low-quality structural and binding data is detrimental for predictive performance. We actually found that low-quality data is not only non-detrimental, but beneficial for the predictive performance of machine-learning scoring functions, though the improvement is less important than that coming from high-quality data. Furthermore, we observed that classical scoring functions are not able to effectively exploit data beyond an early threshold, regardless of its quality. This demonstrates that exploiting a larger data volume is more important for the performance of machine-learning scoring functions than restricting to a smaller set of higher data quality.

Structure-Based Optimization and Biological Evaluation of Pancreatic Lipase Inhibitors as Novel Potential Antiobesity Agents

The unusual fused β-lactone vibralactone was isolated from cultures of the basidiomycete Boreostereum vibrans and has been shown to significantly inhibit pancreatic lipase. In this study, a structure-based lead optimization of vibralactone resulted in three series of 104 analogs, among which compound C1 exhibited the most potent inhibition of pancreatic lipase, with an IC50 value of 14 nM. This activity is more than 3000-fold higher than that of vibralactone. The effect of compound C1 on obesity was investigated using high-fat diet (HFD)-induced C57BL/6 J obese mice. Treatment with compound C1 at a dose of 100 mg/kg significantly decreased HFD-induced obesity, primarily through the improvement of metabolic parameters, such as triglyceride levels.

Recent improvements to Binding MOAD: a resource for protein-ligand binding affinities and structures

For over 10 years, Binding MOAD (Mother of All Databases; http://www.BindingMOAD.org) has been one of the largest resources for high-quality protein-ligand complexes and associated binding affinity data. Binding MOAD has grown at the rate of 1994 complexes per year, on average. Currently, it contains 23,269 complexes and 8156 binding affinities. Our annual updates curate the data using a semi-automated literature search of the references cited within the PDB file, and we have recently upgraded our website and added new features and functionalities to better serve Binding MOAD users. In order to eliminate the legacy application server of the old platform and to accommodate new changes, the website has been completely rewritten in the LAMP (Linux, Apache, MySQL and PHP) environment. The improved user interface incorporates current third-party plugins for better visualization of protein and ligand molecules, and it provides features like sorting, filtering and filtered downloads. In addition to the field-based searching, Binding MOAD now can be searched by structural queries based on the ligand. In order to remove redundancy, Binding MOAD records are clustered in different families based on 90% sequence identity. The new Binding MOAD, with the upgraded platform, features and functionalities, is now equipped to better serve its users.