Similarity searching in REACCS. a new tool for the synthetic chemist
Journal of Chemical Information & Computer Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the Approximability of the Maximum Common Subgraph Problem
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Finding and Counting Given Length Cycles (Extended Abstract)
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Normal forms for trivalent graphs and graphs of bounded valence
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
Extraction of mapping rules of atoms from enzymatic reaction data is useful for drug design, simulation of tracer experiments and consistency checking of pathway databases. Most of previous methods for this problem are based on maximal common subgraph algorithms. In this paper, we propose a novel approach based on graph partition and graph isomorphism. We show that this problem is NP-hard in general, but can be solved in polynomial time for wide classes of enzymatic reactions. We also present an O(n1.5) time algorithm for a special but fundamental class of reactions, where n is the maximum size of compounds appearing in a reaction. We develop practical polynomial time algorithms in which the Morgan algorithm is used for computing the normal form of a graph, where it is known that the Morgan algorithm works correctly for most chemical structures. Computational experiments are performed for these practical algorithms using the chemical reaction data stored in the KEGG/LIGAND database. The results of computational experiments suggest that practical algorithms are useful in many cases.