Computer Aided Organic Synthesis Based on Graph Grammars

Article Preview

Abstract:

Traditionally, computer aided organic synthesis is based on the one-dimensional string model that employs string grammars to tackle the structure of molecular; the processing of organic reactions, and the establishment of the knowledge bases and file systems. Because of the limitations of one-dimensional method for tackling two-dimensional issues like organic syntheses, this paper presents a method for computer aided organic synthesis based on two-dimensional graph grammars. The method could apply the basic principle of the graph grammars to effectively and efficiently solve organic synthesis problems.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

227-230

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] E. A. Geivandov, A Language for Notation of Generalised Structures of Organic Compounds Containing Alternative Delocated Fragments (Markush Structures), Nauchno-Tekh. Inf, Ser. 2, 46, (10)21(1972).

Google Scholar

[2] Ehrig H , Kreowski H2 J , Montanari U , et al . Handbook of Graph Grammars and Computing by Graph Transformations: Concurrency, parallelism, and Dist ribution. Singapore: World scientific Publishing , 1999, 3.

DOI: 10.1142/4181

Google Scholar

[3] Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation. Volume11. Singapore: world scientific Publishing, (1997).

Google Scholar

[4] Ehrig H, Engels G, Kreowski H2 J, et al. Handbook of Graph Grammars and Computing by Graph Transformation: Applications , languages and Tools. Singapore: World scientific Publish2ing , 1999 , 2.

DOI: 10.1142/4180

Google Scholar

[5] Drewes F, Hoffmann B, J anssens D, et al. Adaptive Star Grammar. ICGT, 2006: 77291.

Google Scholar

[6] Pfaltz J. Web Grammars and Picture Description. Computer Graphics and Image Processing, 1972, 1 (1): 1932220.

DOI: 10.1016/s0146-664x(72)80015-7

Google Scholar

[7] Bunke H. At t ributed Programmed Graph Grammars and Their Application to Schematic Diagram Interpretation. IEEE Pattern Analysis and Machine Intelligence, 1982, 4 (6): 5742582.

DOI: 10.1109/tpami.1982.4767310

Google Scholar

[8] Rekers, J, Schü rr A. Defining and Parsing Visual Languages with Layered Graph Grammars. Journal of Visual Languages and Computing, 1997, 8 (1): 27255.

DOI: 10.1006/jvlc.1996.0027

Google Scholar

[9] Zhang DQ, Zhang K, Cao JN, A context-sensitive graph grammar formalism for the specification of visual languages. The Computer Journal, 2001, 44(3): 187-200.

DOI: 10.1093/comjnl/44.3.186

Google Scholar

[10] ZENG Xiao-Qin, HAN Xiu-Qing, ZOU Yang. An Edge-Based Context-Sensitive Graph Grammar Formalism. Journal of Software, Vol. 19, No. 8, August 2008, p.1893-(1901).

DOI: 10.3724/sp.j.1001.2008.01893

Google Scholar