Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery

Abstract Graph embedding (subgraph isomorphism) is an NP-complete problem of great theoretical and practical importance in the sciences, especially chemistry and computer science. This paper presents positive test results for techniques to speed embedding by modeling graphs with subroutines, precalculating edge tables, turning recursion into iteration, and using search-ordering heuristics. The expert system synchem 2 searches for synthesis routes of organic molecules without the online guidance of a user, and this paper examines how embedding information helps to implement the central operations of synchem 2: selection, application, and evaluation of chemical reactions. The paper also outlines the architecture of synchem 2, analyzes the computational time complexity of embedding and related problems in graph isomorphism and canonical chemical naming, and suggests topics and techniques for further research.

[1]  Ranan B. Banerji,et al.  Artificial Intelligence: A Theoretical Approach , 1980 .

[2]  Nicholas V. Findler,et al.  Associative Networks- Representation and Use of Knowledge by Computers , 1980, CL.

[3]  Henry W. Davis Computer Representation of the Stereochemistry of Organic Molecules , 1976 .

[4]  Robert E. Tarjan,et al.  Graph Algorithms in Chemical Computation , 1977 .

[5]  King-Sun Fu,et al.  Syntactic Methods in Pattern Recognition , 1974, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Alan Tucker,et al.  Applied Combinatorics , 1980 .

[7]  Lubomir F. Bic Processing of Semantic Nets on Dataflow Architectures , 1985, Artif. Intell..

[8]  Donald B. Johnson,et al.  Lower Bounds for Selection in X + Y and Other Multisets , 1978, JACM.

[9]  Jaime G. Carbonell,et al.  Metaphor and common-sense reasoning , 1983 .

[10]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[11]  Gary L. Miller,et al.  Isomorphism of k-Contractible Graphs. A Generalization of Bounded Valence and Bounded Genus , 1983, Inf. Control..

[12]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[13]  Theodosios Pavlidis,et al.  Linear and Context-Free Graph Grammars , 1972, JACM.

[14]  Alan C. Shaw,et al.  PICTURE GRAPHS, GRAMMARS, AND PARSING**This work was supported in part by The National Science Foundation grant GJ-108. , 1972 .

[15]  Alfred V. Aho,et al.  The design and analysis of algorithms , 1974 .

[16]  Azriel Rosenfeld,et al.  Picture processing: 1977 , 1978 .

[17]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[18]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[19]  Rudolf Munz The WELL system: a multi-user database system based on binary relationships and graph-pattern-matching , 1978, Inf. Syst..

[20]  Azriel Rosenfeld,et al.  Web Grammars , 1969, IJCAI.

[21]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[22]  A F Sanders,et al.  Empirical Explorations of SYNCHEM , 1977, Science.

[23]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[24]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[25]  H. L. Morgan The Generation of a Unique Machine Description for Chemical Structures-A Technique Developed at Chemical Abstracts Service. , 1965 .

[26]  Louis J. O'korn Algorithms in the Computer Handling of Chemical Information , 1977 .

[27]  Donald A. Norman,et al.  Explorations in Cognition , 1975 .

[28]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[29]  Eugene M. Luks Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.

[30]  Christoph M. Hoffmann,et al.  Group-Theoretic Algorithms and Graph Isomorphism , 1982, Lecture Notes in Computer Science.

[31]  Harry G. Barrow,et al.  SOME TECHNIQUES FOR RECOGNISING STRUCTURES IN PICTURES , 1972 .