A Novel Method for the Inverse QSAR/QSPR based on Artificial Neural Networks and Mixed Integer Linear Programming with Guaranteed Admissibility

被引:12
作者
Azam, Naveed Ahmed [1 ]
Chiewvanichakorn, Rachaya [1 ]
Zhang, Fan [1 ]
Shurbevski, Aleksandar [1 ]
Nagamochi, Hiroshi [1 ]
Akutsu, Tatsuya [2 ]
机构
[1] Kyoto Univ, Dept Appl Math & Phys, Kyoto, Japan
[2] Kyoto Univ, Bioinformat Ctr, Inst Chem Res, Uji, Japan
来源
PROCEEDINGS OF THE 13TH INTERNATIONAL JOINT CONFERENCE ON BIOMEDICAL ENGINEERING SYSTEMS AND TECHNOLOGIES, VOL 3: BIOINFORMATICS | 2020年
关键词
QSAR/QSPR; Artificial Neural Networks; Mixed Integer Programming; Feature Vectors; Chemical Graphs; INDEXES; QSPR;
D O I
10.5220/0008876801010108
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
Inverse QSAR/QSPR is a well-known approach for computer-aided drug design. In this study, we propose a novel method for inverse QSAR/QSPR using artificial neural network (ANNs) and mixed integer linear programming In this method, we introduce a feature function f that converts each chemical compound G into a vector f (G) of several descriptors of G. Next, given a set of chemical compounds along with their chemical properties, we construct a prediction function iv with an ANN so that psi( f (G)) takes a value nearly equal to a given chemical property for many chemical compounds G in the set. Then, given a target value y* of the chemical property, we conversely infer a chemical structure G K having the desired property y* in the following way. We formulate the problem of finding a vector x* such that (i) psi(x*) = y and (ii) there exists a chemical compound G* such that f(G*) = x* (if one exists over all vectors x* in (i)) as a mixed integer linear programming problem (MILP). In an existing method for the inverse QSAR/QSPR, the second condition (ii) was not guaranteed. For acyclic chemical compounds and some chemical properties such as heat of formation, boiling point, and retention time, we conducted computational experiments.
引用
收藏
页码:101 / 108
页数:8
相关论文
共 11 条
[1]   A Mixed Integer Linear Programming Formulation to Artificial Neural Networks [J].
Akutsu, Tatsuya ;
Nagamochi, Hiroshi .
PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND SYSTEMS (ICISS 2019), 2019, :215-220
[2]  
[Anonymous], 2017, PMLR
[3]  
Chiewvanichakorn R., 2020, ICBBB2020
[4]   Enumerating treelike chemical graphs with given path frequency [J].
Fujiwara, Hiroki ;
Wang, Jiexun ;
Zhao, Liang ;
Nagamochi, Hiroshi ;
Akutsu, Tatsuya .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2008, 48 (07) :1345-1357
[5]   Automatic Chemical Design Using a Data-Driven Continuous Representation of Molecules [J].
Gomez-Bombarelli, Rafael ;
Wei, Jennifer N. ;
Duvenaud, David ;
Hernandez-Lobato, Jose Miguel ;
Sanchez-Lengeling, Benjamin ;
Sheberla, Dennis ;
Aguilera-Iparraguirre, Jorge ;
Hirzel, Timothy D. ;
Adams, Ryan P. ;
Aspuru-Guzik, Alan .
ACS CENTRAL SCIENCE, 2018, 4 (02) :268-276
[6]   Artificial neural network modeling of Kovats retention indices for noncyclic and monocyclic terpenes [J].
Jalali-Heravi, M ;
Fatemi, MH .
JOURNAL OF CHROMATOGRAPHY A, 2001, 915 (1-2) :177-183
[7]   Inverse QSPR/QSAR Analysis for Chemical Structure Generation (from y to x) [J].
Miyao, Tomoyuki ;
Kaneko, Hiromasa ;
Funatsu, Kimito .
JOURNAL OF CHEMICAL INFORMATION AND MODELING, 2016, 56 (02) :286-299
[8]   Comparative QSPR studies with molecular connectivity, molecular negentropy and TAU indices - Part I: Molecular thermochemical properties of diverse functional acyclic compounds [J].
Roy, K ;
Saha, A .
JOURNAL OF MOLECULAR MODELING, 2003, 9 (04) :259-270
[9]   Generating Focused Molecule Libraries for Drug Discovery with Recurrent Neural Networks [J].
Segler, Marwin H. S. ;
Kogej, Thierry ;
Tyrchan, Christian ;
Waller, Mark P. .
ACS CENTRAL SCIENCE, 2018, 4 (01) :120-131
[10]   INVERSE PROBLEM IN QSAR QSPR STUDIES FOR THE CASE OF TOPOLOGICAL INDEXES CHARACTERIZING MOLECULAR SHAPE (KIER INDEXES) [J].
SKVORTSOVA, MI ;
BASKIN, II ;
SLOVOKHOTOVA, OL ;
PALYULIN, VA ;
ZEFIROV, NS .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1993, 33 (04) :630-634