KDEEP: Protein-Ligand Absolute Binding Affinity Prediction via 3D-Convolutional Neural Networks

被引:570
作者
Jimenez, Jose [1 ]
Skalic, Miha [1 ]
Martinez-Rosell, Gerard [1 ]
De Fabritiis, Gianni [1 ,2 ]
机构
[1] Univ Pompeu Fabra, Computat Biophys Lab, Parc Recerca Biomed Barcelona, Barcelona 08003, Spain
[2] ICREA, Passeig Lluis Co 23, Barcelona 08010, Spain
关键词
OUT CROSS-VALIDATION; SCORING FUNCTIONS; RANDOM FOREST; DOCKING; APPROPRIATE; INHIBITORS; ACCURACY; DESIGN; SET;
D O I
10.1021/acs.jcim.7b00650
中图分类号
R914 [药物化学];
学科分类号
100701 ;
摘要
Accurately predicting protein-ligand binding affinities is an important problem in computational chemistry since it can substantially accelerate drug discovery for virtual screening and lead optimization. We propose here a fast machine-learning approach for predicting binding affinities using state-of-the-art 3D-convolutional neural networks and compare this approach to other machine-learning and scoring methods using several diverse data sets. The results for the standard PDBbind (v.2016) core test-set are state-of-the-art with a Pearson's correlation coefficient of 0.82 and a RMSE of 1.27 in pK units between experimental and predicted affinity, but accuracy is still very sensitive to the specific protein used. K-DEEP is made available via PlayMolecule.org for users to test easily their own protein-ligand complexes, with each prediction taking a fraction of a second. We believe that the speed, performance, and ease of use of K-DEEP makes it already an attractive scoring function for modern computational chemistry pipelines.
引用
收藏
页码:287 / 296
页数:10
相关论文
共 61 条
[1]   Machine-learning scoring functions to improve structure-based binding affinity prediction and virtual screening [J].
Ain, Qurrat Ul ;
Aleksandrova, Antoniya ;
Roessler, Florian D. ;
Ballester, Pedro J. .
WILEY INTERDISCIPLINARY REVIEWS-COMPUTATIONAL MOLECULAR SCIENCE, 2015, 5 (06) :405-424
[2]   Deep learning for computational biology [J].
Angermueller, Christof ;
Parnamaa, Tanel ;
Parts, Leopold ;
Stegle, Oliver .
MOLECULAR SYSTEMS BIOLOGY, 2016, 12 (07)
[3]  
[Anonymous], IEEE C COMP VIS PATT
[4]  
[Anonymous], 2015, ARXIV150909292
[5]  
[Anonymous], ARXIV160207360
[6]  
[Anonymous], 2016, ARXIV160502688 THEAN
[7]   The inner and outer approaches to the design of recursive neural architectures [J].
Baldi, Pierre .
DATA MINING AND KNOWLEDGE DISCOVERY, 2018, 32 (01) :218-230
[8]   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 [J].
Ballester, Pedro J. ;
Mitchell, John B. O. .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2011, 51 (08) :1739-1741
[9]   A machine learning approach to predicting protein-ligand binding affinity with applications to molecular docking [J].
Ballester, Pedro J. ;
Mitchell, John B. O. .
BIOINFORMATICS, 2010, 26 (09) :1169-1175
[10]   Binding MOAD, a high-quality protein-ligand database [J].
Benson, Mark L. ;
Smith, Richard D. ;
Khazanov, Nickolay A. ;
Dimcheff, Brandon ;
Beaver, John ;
Dresslar, Peter ;
Nerothin, Jason ;
Carlson, Heather A. .
NUCLEIC ACIDS RESEARCH, 2008, 36 :D674-D678