| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 2079243 | Computational and Structural Biotechnology Journal | 2013 | 9 Pages |
Abstract
Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems: determining whether two chemical graphs are identical, determining whether one input chemical graph is a part of the other input chemical graph, finding a maximum common part of two input graphs, finding a reaction atom mapping, enumerating possible chemical graphs, and enumerating stereoisomers. We also discuss the relationship between the fifth problem and kernel functions for chemical compounds.
Related Topics
Life Sciences
Biochemistry, Genetics and Molecular Biology
Biotechnology
Authors
Tatsuya Akutsu, Hiroshi Nagamochi,