このアイテムのアクセス数: 76
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
s13015-021-00197-2.pdf | 5.23 MB | Adobe PDF | 見る/開く |
タイトル: | A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming |
著者: | Azam, Naveed Ahmed Zhu, Jianshen Sun, Yanming Shi, Yu Shurbevski, Aleksandar ![]() ![]() Zhao, Liang ![]() ![]() ![]() Nagamochi, Hiroshi ![]() Akutsu, Tatsuya ![]() ![]() ![]() |
著者名の別形: | 朱, 見深 趙, 亮 永持, 仁 阿久津, 達也 |
キーワード: | QSAR/QSPR Molecular design Artificial neural network Mixed integer linear programming Enumeration of graphs 05C92 92E10 05C30 68T07 90C11 92-04 |
発行日: | 2021 |
出版者: | Springer Nature BMC |
誌名: | Algorithms for Molecular Biology |
巻: | 16 |
論文番号: | 18 |
抄録: | Analysis of chemical graphs is becoming a major research topic in computational molecular biology due to its potential applications to drug design. One of the major approaches in such a study is inverse quantitative structure activity/property relationship (inverse QSAR/QSPR) analysis, which is to infer chemical structures from given chemical activities/properties. Recently, a novel two-phase framework has been proposed for inverse QSAR/QSPR, where in the first phase an artificial neural network (ANN) is used to construct a prediction function. In the second phase, a mixed integer linear program (MILP) formulated on the trained ANN and a graph search algorithm are used to infer desired chemical structures. The framework has been applied to the case of chemical compounds with cycle index up to 2 so far. The computational results conducted on instances with n non-hydrogen atoms show that a feature vector can be inferred by solving an MILP for up to n=40, whereas graphs can be enumerated for up to n=15. When applied to the case of chemical acyclic graphs, the maximum computable diameter of a chemical structure was up to 8. In this paper, we introduce a new characterization of graph structure, called “branch-height” based on which a new MILP formulation and a new graph search algorithm are designed for chemical acyclic graphs. The results of computational experiments using such chemical properties as octanol/water partition coefficient, boiling point and heat of combustion suggest that the proposed method can infer chemical acyclic graphs with around n=50 and diameter 30. |
著作権等: | © The Author(s) 2021. This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. |
URI: | http://hdl.handle.net/2433/276894 |
DOI(出版社版): | 10.1186/s13015-021-00197-2 |
PubMed ID: | 34391471 |
出現コレクション: | 学術雑誌掲載論文等 |

このアイテムは次のライセンスが設定されています: クリエイティブ・コモンズ・ライセンス