arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.09646cs.DScs.CE
收藏

基于人工神经网络和可编程技术的有界支高无环化合物推理新方法

A Novel Method for Inference of Acyclic Chemical Compounds with Bounded Branch-height Based on Artificial Neural Networks and Integer Programming

Naveed Ahmed Azam, Jianshen Zhu, Yanming Sun, Yu Shi, Aleksandar Shurbevski, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu

摘要:

化学图分析是计算分子生物学中的一个重要研究课题,因为它在药物设计中具有潜在的应用价值。一种方法是逆定量结构活性/性质关系(逆QSAR/QSPR)分析,其是从给定的化学活性/性质推断化学结构。最近,已经提出了一个框架,用于逆QSAR/QSPR使用人工神经网络(ANN)和混合整数线性规划(MILP)。该方法由预测阶段和逆预测阶段组成。在第一阶段中,引入化学图$G$的特征向量$f(G)$,并利用人工神经网络构造关于化学性质$π$的预测函数$ψ$;在第二阶段中,给定性质$π$的目标值$y^*$,通过求解由训练的ANN制定的MILP来推断特征向量$x^*$,使得$ψ(x^*)$接近于$y^*$,然后是一组化学结构$G^*$,使得通过图搜索算法来枚举$f(G^*)= x^*$。该框架已被应用于循环指数高达2的化合物的情况下。对$n$非氢原子的实例进行的计算结果表明,特征向量$x^*$可以推断为$n=40$左右,而图$G^*$可以枚举为$n=15$。当应用于化学无环图的情况下,$G^*$的最大可计算直径约为8。我们引入了一个新的图形结构的表征,“分支高度”,基于此MILP制定和图搜索算法的化学无环图的设计。利用辛醇/水分配系数、沸点和燃烧热等性质的计算实验结果表明,该方法可以推断出具有$n=50$和直径为30的化学无环图$G^*$.

英文摘要:

Analysis of chemical graphs is a major research topic in computational molecular biology due to its potential applications to drug design. One approach is inverse quantitative structure activity/property relationship (inverse QSAR/QSPR) analysis, which is to infer chemical structures from given chemical activities/properties. Recently, a framework has been proposed for inverse QSAR/QSPR using artificial neural networks (ANN) and mixed integer linear programming (MILP). This method consists of a prediction phase and an inverse prediction phase. In the first phase, a feature vector $f(G)$ of a chemical graph $G$ is introduced and a prediction function $ψ$ on a chemical property $π$ is constructed with an ANN. In the second phase, given a target value $y^*$ of property $π$, a feature vector $x^*$ is inferred by solving an MILP formulated from the trained ANN so that $ψ(x^*)$ is close to $y^*$ and then a set of chemical structures $G^*$ such that $f(G^*)= x^*$ is enumerated by a graph search algorithm. The framework has been applied to the case of chemical compounds with cycle index up to 2. The computational results conducted on instances with $n$ non-hydrogen atoms show that a feature vector $x^*$ can be inferred for up to around $n=40$ whereas graphs $G^*$ can be enumerated for up to $n=15$. When applied to the case of chemical acyclic graphs, the maximum computable diameter of $G^*$ was around up to around 8. We introduce a new characterization of graph structure, "branch-height," based on which an MILP formulation and a graph search algorithm are designed for chemical acyclic graphs. The results of computational experiments using properties such as octanol/water partition coefficient, boiling point and heat of combustion suggest that the proposed method can infer chemical acyclic graphs $G^*$ with $n=50$ and diameter 30.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑