Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs
Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs
复制标题
资源削减,树状化学图枚举算法的新边界过程
DOI:
10.1109/tcbb.2018.2832061
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Tatsuya Akutsu
中科院分区:
文献类型:
--
作者:
Yuhei Nishiyama;Aleksandar Shurbevski ;Hiroshi Nagamochi;Tatsuya Akutsu
Enumerating chemical compounds with given structural properties plays an important role in structure elucidation, with applications such as drug design. We focus on the problem of enumerating tree-like chemical graphs specified by upper and lower bounds on feature vectors, where chemical graphs represent compounds, and a feature vector characterizes frequencies of finite paths in a graph. Building on the branch-and-bound algorithm proposed in earlier work, we propose a new bounding procedure, calledResource Cut, to speed up the enumeration process. Tree-like chemical graphs are modeled as vertex-colored trees, colors representing chemical elements. The algorithm is based on a scheme of generating each unique colored tree with a specified numberof vertices. A colored tree is constructed by repeatedly appending vertices. Given a setofcolored vertices, we found that the algorithm often constructs trees that cannot be extended to a unique representation of a colored tree no matter how the remaining unused colored vertices in the setare appended. We derive a mathematical condition to detect and discard such trees. Experimental results show thatResource Cutsignificantly reduces the search space. We have been able to obtain exact numbers of chemical graphs with up to 17 vertices excluding hydrogen atoms.