Abstract
DNA computing as a field started in 1994 when Leonard Adleman solved a hard computational problem entirely by manipulations of DNA molecules in a test tube [1]. The premise behind DNA computing is that DNA is capable of storing information, while various laboratory techniques that operate on and modify DNA strands (called bio-operations in the sequel) can be used to perform computational steps. Most DNA computations consists of three basic stages. The first is encoding the problem using single-stranded or double-stranded DNA. Then the actual computation is performed by employing a succession of bio-operations [14]. Finally, the DNA strands representing the solution to the problem are detected and decoded. Because of the nature of the substrate in which the data is encoded, namely DNA strands, problems can occur at the encoding stage which would not occur in an electronic medium. In order to describe these problems and our attempts at solutions, we now briefly present some basic molecular biology notions and notations.
Research partially supported by Grants R0504A01 and R2824A01 of the Natural Sciences and Engineering Research Council of Canada.
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
L. Adleman. Molecular Computation of Solutions to Combinatorial Problems. Science, 266, 1994, 1021–1024.
E.B. Baum. DNA Sequences Useful for Computation. Proceedings of DNA-based Computers II, Princeton. In AMS DIMACS Series, vol.44, L.F. Landweber, E. Baum Eds., 1998, 235–241.
R. Deaton, R. Murphy, M. Garzon, D.R. Franceschetti, S.E. Stevens. Good Encodings for DNA-based Solutions to Combinatorial Problems. Proceedings of DNA-based Computers II, Princeton. In AMS DIMACS Series, vol.44, L.F. Landweber, E. Baum Eds., 1998, 247–258.
R. Deaton, M. Garzon, R. Murphy, D.R. Franceschetti, S.E. Stevens. Genetic Search of Reliable Encodings for DNA Based Computation, First Conference on Genetic Programming GP-96, Stanford U., 1996, 9–15.
R. Deaton, R.E. Murphy, J.A. Rose, M. Garzon, D.R. Franceschetti, S.E. Stevens Jr. A DNA Based Implementation of an Evolutionary Searchfor Good Encodings for DNA Computation. Proc. IEEE Conference on Evolutionary Computation ICEC-97, 267–271.
U. Feldkamp, S. Sagha., H. Rauhe. DNASequenceGenerator— A Program for the Construction of DNA Sequences. In [16], 179–189.
A.G. Frutos, Q. Liu, A.J. Thiel, A.M.W. Sanner, A.E. Condon, L.M. Smith, R.M. Corn. Demonstration of a Word Design Strategy for DNA Computing on Surfaces. Nucleic Acids Research, 25(23), 1997, 4748–4757.
M. Garzon, P. Neathery, R. Deaton, R.C. Murphy, D.R. Franceschetti, S.E. Stevens Jr., A New Metric for DNA Computing. In J.R. Koza, K. Deb, M. Dorigo, D.B. Vogel, M. Garzon, H. Iba, R.L. Riolo, Eds., Proc. 2nd Annual Genetic Programming Conference, Stanford, CA, 1997, Morgan-Kaufmann, 472–478.
M. Garzon, R. Deaton, L.F. Nino, S.E. Stevens Jr., M. Wittner. Genome Encoding for DNA Computing Proc. 3rd Genetic Programming Conference, Madison, WI, 1998, Morgan Kaufmann, 684–690.
M. Garzon, C. Oehmen. Biomolecular Computation in Virtual Test Tubes. In [16], 75–83.
A.J. Hartemink, D.K. Gifford, J. Khodor. Automatic Constraint-Based Nucleotide Sequence Selection for DNA Computations. Proceedings of DNA-based Computers IV, Philadelphia. In Biosystems vol.52, nr.1–3, L. Kari, H. Rubin, D.H.Wood Guest Eds., 1999, 227–235.
H. Jürgensen, S. Konstantinidis. Codes. In [11] vol.3, 511–600.
L. Kari. DNA Computing: Arrival of Biological Mathematics. The Mathematical Intelligencer, vol.19, nr.2, Spring 1997, 9–22.
A. Marathe, A. Condon, R. Corn. On Combinatorial DNA Word Design. Proceeedings of DNA-based Computers V, June 14–15, 1999, E. Winfree, D. Gifford Eds., 75–89.
J.H. Reif, T.H. LaBean, M. Pirrung, V.S. Rana, B. Guo, C. Kingsford, G.S. Wickham. Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability. In [16], 241–250.
H.J. Shyr, Free Monoids and Languages, Hon Min Book Company, Taichung, Taiwan, R.O.C., 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kari, L., Kitto, R., Thierrin, G. (2002). Codes, Involutions, and DNA Encodings. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_21
Download citation
DOI: https://doi.org/10.1007/3-540-45711-9_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43190-9
Online ISBN: 978-3-540-45711-4
eBook Packages: Springer Book Archive