Prediction of protein-ligand binding affinities using multiple instance learning

被引:9
作者
Teramoto, Reiji [1 ]
Kashima, Hisashi [2 ]
机构
[1] NEC Informatec Syst Ltd, Adv Technol Solut Div, Takatsu Ku, Kanagawa 2138511, Japan
[2] Univ Tokyo, Dept Math Informat, Grad Sch Informat Sci & Technol, Bunkyo Ku, Tokyo 1138656, Japan
关键词
Scoring function; Binding affinity; Docking program; Virtual screening; Structure-based drug design; Machine learning; Multiple instance learning; Boosting; EMPIRICAL SCORING FUNCTIONS; FREE-ENERGY CALCULATIONS; COMPOUND CLASSIFICATION; DOCKING; TOOL;
D O I
10.1016/j.jmgm.2010.09.006
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Accurate prediction of protein-ligand binding affinities for lead optimization in drug discovery remains an important and challenging problem on scoring functions for docking simulation. In this paper, we propose a data-driven approach that integrates multiple scoring functions to predict protein-ligand binding affinity directly. We then propose a new method called multiple instance regression based scoring (MIRS) that incorporates unbound ligand conformations using multiple scoring functions. We evaluated the predictive performance of MIRS using 100 protein-ligand complexes and their binding affinities. The experimental results showed that MIRS outperformed the 11 conventional scoring functions including LigScore, PLP, AutoDock, G-Score, D-Score, LUDI, F-Score, ChemScore, X-Score, PMF, and DrugScore. In addition, we confirmed that MIRS performed well on binding pose prediction. Our results reveal that it is indispensable to incorporate unbound ligand conformations in both binding affinity prediction and binding pose prediction. The proposed method will accelerate efficient lead optimization on structure-based drug design and provide a new direction to designing of new scoring score functions. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码:492 / 497
页数:6
相关论文
共 31 条
[1]   NEW METHOD FOR PREDICTING BINDING-AFFINITY IN COMPUTER-AIDED DRUG DESIGN [J].
AQVIST, J ;
MEDINA, C ;
SAMUELSSON, JE .
PROTEIN ENGINEERING, 1994, 7 (03) :385-391
[3]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[4]   Protein docking along smooth association pathways [J].
Camacho, CJ ;
Vajda, S .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2001, 98 (19) :10636-10641
[5]   AN EXTENDED LINEAR-RESPONSE METHOD FOR DETERMINING FREE-ENERGIES OF HYDRATION [J].
CARLSON, HA ;
JORGENSEN, WL .
JOURNAL OF PHYSICAL CHEMISTRY, 1995, 99 (26) :10667-10673
[6]   Solving the multiple instance problem with axis-parallel rectangles [J].
Dietterich, TG ;
Lathrop, RH ;
LozanoPerez, T .
ARTIFICIAL INTELLIGENCE, 1997, 89 (1-2) :31-71
[7]   Empirical scoring functions .1. The development of a fast empirical scoring function to estimate the binding affinity of ligands in receptor complexes [J].
Eldridge, MD ;
Murray, CW ;
Auton, TR ;
Paolini, GV ;
Mee, RP .
JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 1997, 11 (05) :425-445
[8]   DOCK 4.0: Search strategies for automated molecular docking of flexible molecule databases [J].
Ewing, TJA ;
Makino, S ;
Skillman, AG ;
Kuntz, ID .
JOURNAL OF COMPUTER-AIDED MOLECULAR DESIGN, 2001, 15 (05) :411-428
[9]   Greedy function approximation: A gradient boosting machine [J].
Friedman, JH .
ANNALS OF STATISTICS, 2001, 29 (05) :1189-1232
[10]   MOLECULAR RECOGNITION OF THE INHIBITOR AG-1343 BY HIV-1 PROTEASE - CONFORMATIONALLY FLEXIBLE DOCKING BY EVOLUTIONARY PROGRAMMING [J].
GEHLHAAR, DK ;
VERKHIVKER, GM ;
REJTO, PA ;
SHERMAN, CJ ;
FOGEL, DB ;
FOGEL, LJ ;
FREER, ST .
CHEMISTRY & BIOLOGY, 1995, 2 (05) :317-324