Abstract
A method has been developed to join together two-dimensional and three-dimensional structure descriptions in the Cambridge Crystallographic Data Files. From the three-dimensional structure description a two-dimensional connection table is derived and then compared with the original two-dimensional connection table. Despite differences in the information which is used to describe the atoms of the two molecule graphs unambiguously, the algorithm minimizes the matching possibilities by classifying the atoms. The relation between the two graphs helps in marking structure templates in the three-dimensional images of molecules as well as making investigations on the three-dimensional structure and attaching the results to the two-dimensional graph representation.
In addition, the rematching algorithm can be used to control and verify the source data with regard to the conformity of the two-dimensional and three-dimensional graph representations.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allen FH et al (1979) Acta Cryst B35:2331
Taylor R (1986) J Mol Graph 4:123
Lang E (1989) Diplomarbeit, Universität Heidelberg
Lang E, Förster T, vd Lieth CW (1990) In:. Gasteiger J (ed) Software Development in Chemistry 4, Springer Berlin/Heidelberg
Forster T, vd Lieth CW, Opferkuch HJ (1989) Git Fachz Lab 33:318
Wipke WT, Dyott TM (1974) J Amer Chem Soc 96:4834
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lang, E., Förster, T. (1991). Matching of 2D and 3D Structure Descriptions in the Cambridge Crystallographic Data Files: Outline of the Method and some Applications. In: Gmehling, J. (eds) Software Development in Chemistry 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76325-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-76325-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53532-4
Online ISBN: 978-3-642-76325-0
eBook Packages: Springer Book Archive