Exhaustive generation of organic isomers. 1. Acyclic structures

The system reported here describes selective, exhaustive, and nonredundant generation and counting algorithms for acyclic connectivity isomers associated with any molecular formula. Isomer structures can have multiple bonds and heteroatoms with mixed valences, as in the case of thiosulfonic acids. Structural isomer characteristics (IC) for each molecular formula are determined according to an expression derived from basic graph principles. The generation process uses a tuple notation and the concept of lexicographic order (see ref 13) and is done in three steps: (i) generation of the skeleton of the acyclic structure; (ii) incorporation of heteroatoms to the structure; (iii) incorporation of multiple bonds. Isomer redundant filtering processes and algorithms for doing a singleor a multiple-pattern restriction over the structures to be generated were developed. The code describing the generated isomers is compact and allows for both efficient molecular database storage and interaction with a graphic interface and with different calculation modules of CAMD such as those of topological indexes, molecular volume, and other molecular properties derived from semiempirical and ab initio methods. The system is therefore of great utility in structure elucidation, in organic synthesis, and especially in molecular design.

[1]  N. S. Sridharan,et al.  Applications of Artificial Intelligence for Chemical Inference. 12. Exhaustive Generation of Cyclic and Acyclic Isomers , 1973 .

[2]  Gerta Rücker,et al.  Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition , 1991, J. Chem. Inf. Comput. Sci..

[4]  Jiri Pospichal,et al.  Canonical indexing and constructive enumeration of molecular graphs , 1990, J. Chem. Inf. Comput. Sci..

[5]  R. Rozas,et al.  Artificial smell detection for robotic navigation , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[6]  H. J. Luinge,et al.  AEGIS, an algorithm for the exhaustive generation of irredundant structures , 1990 .

[7]  T. Akutsu A New Method of Computer Representation of Stereochemistry. Transforming a Stereochemical Structure into a Graph. , 1991 .

[8]  Hidetsugu Abe,et al.  A computer program for generation of constitutionally isomeric structural formulas , 1984, Journal of chemical information and computer sciences.

[9]  Roberto Rozas,et al.  Computational perception and recognition of digitized molecular structures , 1990, J. Chem. Inf. Comput. Sci..

[10]  M. Leonor Contreras,et al.  Personal microcomputer based system of chemical information with topological structure data elaboration , 1987, J. Chem. Inf. Comput. Sci..

[11]  I. P. Bangov Computer-assisted structure generation from a gross formula. 3. Alleviation of the combinatorial problem , 1990, J. Chem. Inf. Comput. Sci..

[12]  Kimito Funatsu,et al.  Further development of structure generation in the automated structure elucidation system CHEMICS , 1988, J. Chem. Inf. Comput. Sci..

[13]  J. V. Knop,et al.  Computer generation of isomeric structures , 1983 .

[14]  Charles J. Colbourn,et al.  Cataloguing the graphs on 10 vertices , 1985, J. Graph Theory.

[15]  Holger Wallmeier,et al.  Computer‐Assisted Molecular Design (CAMD)—An Overview , 1987 .