Comparative assessment of machine-learning scoring functions on PDBbind 2013

Computational docking is the core process of computer-aided drug design (CADD); it aims at predicting the best orientation and conformation of a small molecule (drug ligand) when bound to a target large receptor molecule (protein) in order to form a stable complex molecule. The docking quality is typically measured by a scoring function: a mathematical predictive model that produces a score representing the binding free energy and hence the stability of the resulting complex molecule. An effective scoring function should produce promising drug candidates which can then be synthesized and physically screened using high throughput screening (HTS) process. Therefore, the key to CADD is the design of an efficient highly accurate scoring function. Many traditional techniques have been proposed, however, the performance was generally poor. Only in the last few years the application of the machine learning (ML) technology has been applied in the design of scoring functions; and the results have been very promising.In this paper, we propose 12 scoring functions based on a wide range of ML techniques. We analyze the performance of each on the scoring power (binding affinity prediction), ranking power (relative ranking prediction), docking power (identifying the native binding poses among computer-generated decoys), and screening power (classifying true binders versus negative binders) using the PDBbind 2013 database. We compare our results with the recently published comparative assessment of scoring functions (CASF-2013) of 20 classical scoring functions most of which are implemented in main-stream commercial software. For the scoring and ranking powers, the proposed ML scoring functions depend on a wide range of features (energy terms, pharmacophore, geometrical) that entirely characterize the protein-ligand complexes (about 108 features); these features are extracted from several docking software available in the literature; a feature-space reduction technique, namely, principal component analysis is then applied and the performance is studied accordingly. For the docking and screening powers, the proposed ML scoring functions depend on the geometrical features of the RF-Score (36 features) to utilize a larger number of training complexes (relative to the large number of decoys in the testing set). For the scoring power, the best ML scoring function (RF) achieves a Pearson correlation coefficient between the predicted and experimentally determined binding affinities of 0.704 versus 0.614 achieved by the best classical scoring function ( X-Score HM ). For the ranking power, the best ML scoring function (RF) achieves a Spearman correlation coefficient between the ranks based on the predicted and experimentally determined binding affinities of 0.697 versus 0.626 achieved by the best classical scoring function ( X-Score HM ). For the docking power, the best ML scoring function (BRT) has a success rate in identifying the top best-scored ligand binding pose within 2? root-mean-square deviation from the native pose of 13.8% versus 81.0% achieved by the best classical scoring function (ChemPLP@GOLD). For the screening power, the best ML scoring function (SVM) has an average enrichment factor and success rate at the top 1% level of 3.76 and 6.45% versus 19.54 and 60% respectively achieved by the best classical scoring function (GlideScore-SP).

[1]  Leslie A Kuhn,et al.  Side‐chain flexibility in protein–ligand binding: The minimal rotation hypothesis , 2005, Protein science : a publication of the Protein Society.

[2]  Nihar R. Mahapatra,et al.  Molecular Docking for Drug Discovery: Machine-Learning Approaches for Native Pose Prediction of Protein-Ligand Complexes , 2013, CIBB.

[3]  Hans-Peter Lenhof,et al.  BALL: Biochemical Algorithms Library , 1999, Algorithm Engineering.

[4]  David S. Goodsell,et al.  AutoDock4 and AutoDockTools4: Automated docking with selective receptor flexibility , 2009, J. Comput. Chem..

[5]  Xin Wen,et al.  BindingDB: a web-accessible database of experimentally determined protein–ligand binding affinities , 2006, Nucleic Acids Res..

[6]  Marcel L Verdonk,et al.  General and targeted statistical potentials for protein–ligand interactions , 2005, Proteins.

[7]  Catherine Gwin,et al.  A Comparative Assessment , 1995 .

[8]  Hege S. Beard,et al.  Glide: a new approach for rapid, accurate docking and scoring. 2. Enrichment factors in database screening. , 2004, Journal of medicinal chemistry.

[9]  Matthew P. Repasky,et al.  Extra precision glide: docking and scoring incorporating a model of hydrophobic enclosure for protein-ligand complexes. , 2006, Journal of medicinal chemistry.

[10]  Y. Martin,et al.  A general and fast scoring function for protein-ligand interactions: a simplified potential approach. , 1999, Journal of medicinal chemistry.

[11]  Kwong-Sak Leung,et al.  istar: A Web Platform for Large-Scale Protein-Ligand Docking , 2014, PloS one.

[12]  L. Kuhn,et al.  Virtual screening with solvation and ligand-induced complementarity , 2000 .

[13]  Trevor Hastie,et al.  Regularization Paths for Generalized Linear Models via Coordinate Descent. , 2010, Journal of statistical software.

[14]  Kwong-Sak Leung,et al.  Substituting random forest for multiple linear regression improves binding affinity prediction of scoring functions: Cyscore as a case study , 2014, BMC Bioinformatics.

[15]  Ron Wehrens,et al.  The pls Package: Principal Component and Partial Least Squares Regression in R , 2007 .

[16]  P Willett,et al.  Development and validation of a genetic algorithm for flexible docking. , 1997, Journal of molecular biology.

[17]  Yanli Wang,et al.  PubChem: a public information system for analyzing bioactivities of small molecules , 2009, Nucleic Acids Res..

[18]  Teruki Honma,et al.  Combining Machine Learning and Pharmacophore-Based Interaction Fingerprint for in Silico Screening , 2010, J. Chem. Inf. Model..

[19]  Jerome H. Friedman Multivariate adaptive regression splines (with discussion) , 1991 .

[20]  Luhua Lai,et al.  Further development and validation of empirical scoring functions for structure-based binding affinity prediction , 2002, J. Comput. Aided Mol. Des..

[21]  Bo Wang,et al.  Support Vector Regression Scoring of Receptor-Ligand Complexes for Rank-Ordering and Virtual Screening of Chemical Libraries , 2011, J. Chem. Inf. Model..

[22]  Aniko Simon,et al.  eHiTS: a new fast, exhaustive flexible ligand docking system. , 2007, Journal of molecular graphics & modelling.

[23]  Michael M. Mysinger,et al.  Directory of Useful Decoys, Enhanced (DUD-E): Better Ligands and Decoys for Better Benchmarking , 2012, Journal of medicinal chemistry.

[24]  Zhihai Liu,et al.  Comparative Assessment of Scoring Functions on a Diverse Test Set , 2009, J. Chem. Inf. Model..

[25]  R Core Team,et al.  R: A language and environment for statistical computing. , 2014 .

[26]  Renxiao Wang,et al.  The PDBbind database: collection of binding affinities for protein-ligand complexes with known three-dimensional structures. , 2004, Journal of medicinal chemistry.

[27]  Jacob D. Durrant,et al.  Comparing Neural-Network Scoring Functions and the State of the Art: Applications to Common Library Screening , 2013, J. Chem. Inf. Model..

[28]  Todd J. A. Ewing,et al.  DOCK 4.0: Search strategies for automated molecular docking of flexible molecule databases , 2001, J. Comput. Aided Mol. Des..

[29]  Hans-Joachim Böhm,et al.  Prediction of binding constants of protein ligands: A fast method for the prioritization of hits obtained from de novo design or 3D database search programs , 1998, J. Comput. Aided Mol. Des..

[30]  Peter Gedeck,et al.  Leave-Cluster-Out Cross-Validation Is Appropriate for Scoring Functions Derived from Diverse Protein Data Sets , 2010, J. Chem. Inf. Model..

[31]  G. V. Paolini,et al.  Empirical scoring functions: I. The development of a fast empirical scoring function to estimate the binding affinity of ligands in receptor complexes , 1997, J. Comput. Aided Mol. Des..

[32]  Greg Ridgeway,et al.  Generalized Boosted Models: A guide to the gbm package , 2006 .

[33]  Hans-Joachim Böhm,et al.  The development of a simple empirical scoring function to estimate the binding constant for a protein-ligand complex of known three-dimensional structure , 1994, J. Comput. Aided Mol. Des..

[34]  Jacob D. Durrant,et al.  NNScore 2.0: A Neural-Network Receptor–Ligand Scoring Function , 2011, J. Chem. Inf. Model..

[35]  Gary B. Fogel,et al.  Machine learning approaches for customized docking scores: Modeling of inhibition of Mycobacterium tuberculosis enoyl acyl carrier protein reductase , 2010, 2010 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology.

[36]  Gennady Verkhivker,et al.  Deciphering common failures in molecular docking of ligand-protein complexes , 2000, J. Comput. Aided Mol. Des..

[37]  Didier Rognan,et al.  Beware of Machine Learning-Based Scoring Functions - On the Danger of Developing Black Boxes , 2014, J. Chem. Inf. Model..

[38]  Tom L. Blundell,et al.  Does a More Precise Chemical Description of Protein–Ligand Complexes Lead to More Accurate Prediction of Binding Affinity? , 2014, J. Chem. Inf. Model..

[39]  Philip E. Bourne,et al.  A Machine Learning-Based Method To Improve Docking Scoring Functions and Its Application to Drug Repurposing , 2011, J. Chem. Inf. Model..

[40]  C. Venkatachalam,et al.  LigScore: a novel scoring function for predicting binding affinities. , 2005, Journal of molecular graphics & modelling.

[41]  J. Irwin,et al.  Benchmarking sets for molecular docking. , 2006, Journal of medicinal chemistry.

[42]  Maria I. Zavodszky,et al.  Distilling the essential features of a protein surface for improving protein-ligand docking, scoring, and virtual screening , 2002, J. Comput. Aided Mol. Des..

[43]  John B. O. Mitchell,et al.  Comments on "Leave-Cluster-Out Cross-Validation Is Appropriate for Scoring Functions Derived from Diverse Protein Data Sets": Significance for the Validation of Scoring Functions , 2011, J. Chem. Inf. Model..

[44]  Sabine C. Mueller,et al.  BALL - biochemical algorithms library 1.3 , 2010, BMC Bioinformatics.

[45]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[46]  Zhihai Liu,et al.  Comparative Assessment of Scoring Functions on an Updated Benchmark: 2. Evaluation Methods and General Results , 2014, J. Chem. Inf. Model..

[47]  Gennady M Verkhivker,et al.  Empirical free energy calculations of ligand-protein crystallographic complexes. I. Knowledge-based ligand-protein interaction potentials applied to the prediction of human immunodeficiency virus 1 protease binding affinity. , 1995, Protein engineering.

[48]  Kurt Hornik,et al.  Misc Functions of the Department of Statistics (e1071), TU Wien , 2014 .

[49]  Ajay N. Jain Scoring noncovalent protein-ligand interactions: A continuous differentiable function tuned to compute binding affinities , 1996, J. Comput. Aided Mol. Des..

[50]  Thomas Stützle,et al.  Empirical Scoring Functions for Advanced Protein-Ligand Docking with PLANTS , 2009, J. Chem. Inf. Model..

[51]  Xin Chen,et al.  Optimization of molecular docking scores with support vector rank regression , 2013, Proteins.

[52]  Y. Cheng,et al.  Relationship between the inhibition constant (K1) and the concentration of inhibitor which causes 50 per cent inhibition (I50) of an enzymatic reaction. , 1973, Biochemical pharmacology.

[53]  Lin-Li Li,et al.  ID-Score: A New Empirical Scoring Function Based on a Comprehensive Set of Descriptors Related to Protein-Ligand Interactions , 2013, J. Chem. Inf. Model..

[54]  Jian Wang,et al.  Characterization of Small Molecule Binding. I. Accurate Identification of Strong Inhibitors in Virtual Screening , 2013, J. Chem. Inf. Model..

[55]  Nihar R. Mahapatra,et al.  A Comparative Assessment of Ranking Accuracies of Conventional and Machine-Learning-Based Scoring Functions for Protein-Ligand Binding Affinity Prediction , 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[56]  John B. O. Mitchell,et al.  A machine learning approach to predicting protein-ligand binding affinity with applications to molecular docking , 2010, Bioinform..

[57]  Ingo Muegge Effect of ligand volume correction on PMF scoring , 2001, J. Comput. Chem..

[58]  D. E. Clark,et al.  Flexible docking using tabu search and an empirical estimate of binding affinity , 1998, Proteins.

[59]  I. Muegge A knowledge-based scoring function for protein-ligand interactions: Probing the reference state , 2000 .

[60]  Jie Li,et al.  Comparative Assessment of Scoring Functions on an Updated Benchmark: 1. Compilation of the Test Set , 2014, J. Chem. Inf. Model..

[61]  Matthew P. Repasky,et al.  Glide: a new approach for rapid, accurate docking and scoring. 1. Method and assessment of docking accuracy. , 2004, Journal of medicinal chemistry.

[62]  Andy Liaw,et al.  Classification and Regression by randomForest , 2007 .

[63]  John B. O. Mitchell,et al.  Hierarchical virtual screening for the discovery of new molecular scaffolds in antibacterial hit identification , 2012, Journal of The Royal Society Interface.

[64]  Walid Gomaa,et al.  Machine learning in computational docking , 2015, Artif. Intell. Medicine.