Abstract
The processing of nucleic acids is abstracted using operators on directed and labeled graphs. This provides a computational framework for predicting complex libraries of DNA/RNA arising from sequences of reactions involving hybridisation intermediates with significant combinatorial complexity. It also provides a detailed functional classification scheme for the reactions and side-reactions of DNA processing enzymes. It is complementary to the conventional string-based DNA Computing grammars such as splicing systems, in that the graph-based structure of enzyme-nucleic acid complexes is the fundamental object of combinatorial manipulation and in that the allowed reactions are specified by local graph replacement operators (i.e. catalysts for structural transitions) associated with enzymes. The focus of the work is to present a calculus for the compact specification and evaluation of the combined action of multiple DNA-processing reactions. Each enzyme and its sidereactions may be classified by a small set of small graph replacement operators. Complex replication and computation schemes may be computed with the formalism.
This is a preview of subscription content, log in via an institution to check access.
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
Thue, A.: Probleme über Veränderungen von Zeichenreihen nach gegeben Regeln, Skr. Vid. Kristianaia, I. Mat. Naturv. Klasse 10 (1914) 34pp.
Rozenberg, G. Ed.: Handbook of graph grammars and computing by graph transformation. (World Scientific, Sing.-NJ-London-Hong Kong, 1997).
Narendran, P. and Rusinowitch, M. Ed.: Rewriting Techniques and Applications. LNCS 1631 (Springer, Berlin 1999).
Fontana, W.: Algorithmic Chemistry. Technical Report LA-UR 90-1959, Los Alamos Natl. Lab. (1990).
König, Denes: Theorie der endlichen und unendlichen Graphen (Teubner, Leipzig 1986).
Nagl, Manfred: Bibliography on Graph Rewriting Systems (Graph Grammars, 1983).
Ehrig, Harmut: Tutorial introduction to the algebraic approach of graph grammars.-LNCS 291 3–14 (Springer, Berlin 1987).
Schürr, A.: Programmed graph replacement systems, pp 479–546 in Rozenberg, G. Ed. Handbook of graph grammars and computing by graph transformation. (World Scientific, Sing-NJ-London-Hong Kong, 1997).
Fahy, E., Kwoh, D.Y. and Gingeras, T.R: Self-sustained sequence replication (3SR): an isothermal transcription-based amplification system alternative to PCR. In “PCR Methods and Applications” pp25–33 (Cold Spring Harbor Lab. Press: NY, 1991).
Ehricht, R., Ellinger T., and McCaskill, J.S.: Co-operative amplification of templates by cross hybridisation (CATCH). Europ. J. Biochem. 243 358–364 (1997).
Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science 266 1021–1023 (1994).
Ihlenfeldt, W. and Gasteiger, J.: Computer-assisted planning of organic synthesis: the second generation of programs. Angew. Chem. Int. Ed. Engl. 34 2613–2633 (1995).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McCaskill, J.S., Niemann, U. (2001). Graph replacement chemistry for DNA processing. In: Condon, A., Rozenberg, G. (eds) DNA Computing. DNA 2000. Lecture Notes in Computer Science, vol 2054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44992-2_8
Download citation
DOI: https://doi.org/10.1007/3-540-44992-2_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42076-7
Online ISBN: 978-3-540-44992-8
eBook Packages: Springer Book Archive