Rings — The Importance of Being Perceived

In areas such as retrieval, QSAR, synthesis design, reaction indexing, and structure display, ring analysis is required as a descriptive utility and to complement other structural analyses. Finding those rings necessary and sufficient for unambiguous representation, in an efficient manner and for the worst cases is not trivial. Issues include the 2-D representation of 3-D structures, the definition and perception of a ring set, and whether vertex and cut-vertex graphs simplify the analysis. Generic and partial/sub structures cause particular problems. Substructure queries can be the worst defined, introducing problems for structural conventions and ring/chain differentiation. After ring perception, it is necessary to select and represent the information relevant to a particular application. This can be used as a condensation, to enable more efficient matching, and as an expression, to give more detail to reduced graphs.

[1]  Neil A. B. Gray,et al.  Computer-assisted structure elucidation , 1986 .

[2]  Luděk Matyska.  Fast algorithm for ring perception , 1988 .

[3]  Peter Willett,et al.  Evaluation of Similarity Searching Methods Using Activity and Toxicity Data , 1993 .

[4]  Michael F. Lynch,et al.  Review of ring perception algorithms for chemical graphs , 1989, J. Chem. Inf. Comput. Sci..

[5]  Michael F. Lynch,et al.  Searching a full generics database , 1993 .

[6]  Michael F. Lynch,et al.  Theoretical aspects of ring perception and development of the extended set of smallest rings concept , 1989, J. Chem. Inf. Comput. Sci..

[7]  E. J. Corey,et al.  Algorithm for machine perception of synthetically significant rings in complex cyclic organic structures , 1972 .

[8]  W. T. Wipke,et al.  Techniques for perception by a computer of synthetically significant structural features in complex molecules , 1972 .

[9]  GEOFFREY M. DOWNS,et al.  Computer storage and retrieval of generic chemical structures in patents. 9. An algorithm to find the extended set of smallest rings in structurally explicit generics , 1989, J. Chem. Inf. Comput. Sci..

[10]  Holger Lenz,et al.  Automatic Translation of GENSAL Representations of Markush Structures into Gremas Fragment Codes at IDC , 1993 .

[11]  W. Todd Wipke,et al.  Use of Ring Assemblies in Ring Perception Algorithm , 1975, J. Chem. Inf. Comput. Sci..

[12]  Morris Plotkin,et al.  Mathematical Basis of Ring-Finding Algorithms in CIDS , 1971 .