Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies

04/14/2020
by   Yuui Tamura, et al.
0

We consider a problem of enumerating chemical graphs from given constraints concerning their structures, which has an important application to a novel method for the inverse QSAR/QSPR recently proposed. In this paper, the structure of a chemical graph is specified by a feature vector each of whose entries represents the frequency of a prescribed path. We call a graph a 2-augmented tree if it is obtained from a tree (an acyclic graph) by adding edges between two pairs of nonadjacent vertices. Given a set of feature vectors as the interval between upper and lower bounds of feature vectors, we design an efficient algorithm for enumerating chemical 2-augmented trees that satisfy the path frequency specified by some feature vector in the set. We implemented the proposed algorithm and conducted some computational experiments.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/18/2020

Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications

Enumerating chemical graphs satisfying given constraints is a fundamenta...
09/29/2020

A novel method for inference of chemical compounds with prescribed topological substructures based on integer programming

Analysis of chemical graphs is becoming a major research topic in comput...
09/13/2017

Generation and properties of nut graphs

A nut graph is a graph on at least 2 vertices whose adjacency matrix has...
07/06/2021

An Inverse QSAR Method Based on Linear Regression and Integer Programming

Recently a novel framework has been proposed for designing the molecular...
07/10/2018

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

Network analysis defines a number of centrality measures to identify the...
09/10/2019

Electrical Flows over Spanning Trees

This is the first paper to give provable approximation guarantees for th...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.