Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference

In this paper, we propose a novel family of descriptors of chemical graphs, named cycle-configuration (CC), that can be used in the standard "two-layered (2L) model" of mol-infer, a molecular inference framework based on mixed integer linear programming (MILP) and machine learning (ML). Proposed descriptors capture the notion of ortho/meta/para patterns that appear in aromatic rings, which has been impossible in the framework so far. Computational experiments show that, when the new descriptors are supplied, we can construct prediction functions of similar or better performance for all of the 27 tested chemical properties. We also provide an MILP formulation that asks for a chemical graph with desired properties under the 2L model with CC descriptors (2L+CC model). We show that a chemical graph with up to 50 non-hydrogen vertices can be inferred in a practical time.

Authors

Institutions

Publication Details

Published
2024-12-03
DOI
https://doi.org/10.1109/bibm62325.2024.10822617
Citations
3
Primary Topic
Computational Drug Discovery Methods
Type
article
Field-Weighted Citation Impact
1.08
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference

Tatsuya Akutsu, Bowen Song, Jianshen Zhu, Naveed Ahmed Azam et al.
3 citations
Computational Drug Discovery Methods
1.08
article

Cycle-Configuration: A Novel Graph-theoretic Descriptor Set for Molecular Inference

Tatsuya Akutsu, Bowen Song, Jianshen Zhu, Naveed Ahmed Azam, Kazuya Haraguchi, Liang Zhao
article en
3 citations

Abstract

In this paper, we propose a novel family of descriptors of chemical graphs, named cycle-configuration (CC), that can be used in the standard "two-layered (2L) model" of mol-infer, a molecular inference framework based on mixed integer linear programming (MILP) and machine learning (ML). Proposed descriptors capture the notion of ortho/meta/para patterns that appear in aromatic rings, which has been impossible in the framework so far. Computational experiments show that, when the new descriptors are supplied, we can construct prediction functions of similar or better performance for all of the 27 tested chemical properties. We also provide an MILP formulation that asks for a chemical graph with desired properties under the 2L model with CC descriptors (2L+CC model). We show that a chemical graph with up to 50 non-hydrogen vertices can be inferred in a practical time.

Quaid-i-Azam University (PK), Kyoto University (JP), Kyoto College of Graduate Studies for Informatics (JP)
Openalex Percentile: Top 19%
Computational Drug Discovery Methods
1.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.