Isomer generation: Syntactic rules for detection of isomorphism

Journal of Chemical Information and Computer Sciences

Volumn 39, Issue 3, 1999, Pages 563-568

  Lukovits, István ^a  

^a CHEMICAL RESEARCH CENTER   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040887955     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci9801522     Document Type: Article

References (23)

1. Harary, F. Graph Theory; Addison-Wesley: Reading, 1969; p 179.
2. Knop, J. V.; Müller, W. R.; Szymanski, K.; Nikolić, S.; Trinajstić, N. Computer Generation of Certain Classes of Molecules; SKTH/Kemija u industriji, Zagreb, 1985; p 3.
3. Gutman, I.; Linert, W.; Lukovits, I.; Dobrynin, A. A. Trees with Extremal Hyper-Wiener Index: Mathematical Basis and Chemical Applications. J. Chem. Inf. Comput. Sci. 1997, 37, 349-354.
4. Smith, E. G. The Wiswesser Line-Formula Chemical Notation; McGraw-Hill: New York, 1968; p 1.
5. Lederberg, J.; Sutherland, G. L.; Buchanan, G. G.; Feigenbaum, E. A.; Robertson, A. M.; Duffield, A. M.; Djerassi. Applications of Artificial Intelligence for Chemical Inference. I. The Number of possible Organic Compounds. Acyclic Structures Containing C, H, O and N. J. Am. Chem. Soc. 1969, 91, 2973-2976.
6. Morgan, H. L. The Generation of a Unique Description for Chemical Structures.-A Technique Developed at Chemical Abstracts Service. J. Chem. Doc. 1965, 5, 107-113.
7. Wipke, W. T.; Dyott, T. M. Stereochemically Unique Naming Algorithm. J. Am. Chem. Soc. 1974, 96, 4834-4842.
8. Balaban, A. T. Topological Indices and Their Uses: A New Approach for the Coding of Alkanes. J. Mol. Struct. (THEOCHEM) 1988, 165, 243-253.
9. Nagy, Z. M. How Can Parallel Algorithms Help to Find New Sequential Algorithms? J. Chem. Inf. Comput. Sci. 1993, 33, 542-544.
10. Bangov, I. P. Structure Generation from a Gross Formula. 7. Graph Isomorphism: A Consequence of the Vertex Equivalence. J. Chem. Inf. Comput. Sci. 1992, 32, 167-173.
11. Read, R. C. The Enumeration of Acyclic Chemical Compounds. in Chemical Applications of Graph Theory; Balaban, A. T., Ed.; Academic Press: London, 1976; pp 25-61.
12. Knop, J. V.; Müller, W. R.; Jeričevič, Ž.; Trinajstič, N. Computer Enumeration and Generation of Trees and Rooted Trees. J. Chem. Inf. Comput. Sci. 1981, 21, 91-99.
13. Contreras, M. L.; Rozas, R.; Valdivia, R.; Agüeras, R. Exhaustive Generation of Organic Isomers. 4. Acyclic Stereoisomers with One or More Chiral Carbon Atoms. J. Chem. Inf. Comput. Sci. 1995, 35, 752-758.
14. Hansen, P.; Jaumard, B.; Lebatteux, C.; M. Zheng. Coding Chemical Trees with the Centered N-tuple Code. J. Chem. Inf. Comput. Sci. 1994, 34, 782-790.
15. Hendrickson, J. B.; Toczko, A. Unique Numbering and Cataloguing of Molecular Structures. J. Chem. Inf. Comput. Sci. 1983, 23, 171-177.
16. Randić, M.; Nikolić, S.; Trinajstić, N. Compact Codes; On Nomenclature of Acyclic Chemical Compounds. J. Chem. Inf. Comput. Sci. 1995, 35, 357-365.
17. Kirby, E. C. Coding and Enumeration of Trees that can be Laid upon a Hexagon Lattice. J. Math. Chem. 1992, 11, 187-195.
18. Randić, M. On Canonical Numbering of Atoms in a Molecule and Graph Isomorphism. J. Chem. Inf. Comput. Sci. 1977, 17, 171-180.
19. Strokov, I. A Compact Code for Chemical Structure Storage and Retrieval. J. Chem. Inf. Comput. Sci. 1995, 35, 939-944.
20. Dubois, J. E.; Carrier, G.; Panaye, A. DARC Topological Descriptors for Pattern Recognition in Molecular Database Management Systems and Design. J. Chem. Inf. Comput. Sci. 1991, 31, 574-578.
21. Kvasnička, V.; Pospichal, J. Canonical Indexing and Constructive Enumeration in Molecular Graphs. J. Chem. Inf. Comput. Sci. 1990, 30, 99-105.
22. Lukovits, I. Automatic Generation of Isomeric Structures: A Computer Procedure Employing Semantic Rules. J. Chem. Inf. Comput. Sci. (to be published).
23. Faulon, J. L. Isomorphism, Automorphism, Partitioning, and Canonical Labeling Can be Solved in Polynomial Time for Molecular Graphs. J. Chem. Inf. Comput. Sci. 1998, 38, 432-444.