id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_cq2kwqg6oneihh37tsxgs2xlnm	Joseph D Benstock	Graph embedding in SYNCHEM2, an expert system for organic synthesis discovery	1988	19	.pdf	application/pdf	7633	641	64	Graph embedding (subgraph isomorphism) is an NP-complete problem of great theoretical and 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. complexity of embedding and related problems in graph isomorphism and canonical chemical isomorphism and canonical chemical naming that currently have unknown computational time complexity and that bear upon the deep questions of containment Graph embedding is a central operation in all the following applications involving pattern matching and feature detection: canonical chemical nomenclature and indexing, chemical substructure searching, and synthesis discovery (3) Using embedding in SYNCHEM~, (4) Computational time complexity of embedding and related problems, (5) Techniques to speed embedding, (6) Summary and Graph (PSG) as in Fig. 1, in which a molecule is represented by a compound node, discovery embedding, nontrivial automorphisms and interactions between goal pattern, subgoal pattern, and host graphs often generate redundant compounds and 	./cache/work_cq2kwqg6oneihh37tsxgs2xlnm.pdf	./txt/work_cq2kwqg6oneihh37tsxgs2xlnm.txt