Abstract
The computation language of a DNA-based system consists of all the words (DNA strands) that can appear in any computation step of the system. In this work we define properties of languages which ensure that the words of such languages will not form undesirable bonds when used in DNA computations. We give several characterizations of the desired properties and provide methods for obtaining languages with such properties. The decidability of these properties is addressed as well. As an application we consider splicing systems whose computation language is free of certain undesirable bonds and is generated by nearly optimal comma-free codes.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Research partially supported by Grants R2824A01 and R220259 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
J. Berstel and D. Perrin. Theory of Codes, Academic Press, Inc., Orlando, Florida, 1985.
R. Deaton, R. Murphy, M. Garzon, D.R. Franceschetti, and S.E. Stevens. Good encodings for DNA-based solutions to combinatorial problems. DNA-based computers II, in AMS DIMACS Series, vol. 44, L.F. Landweber and E. Baum, Eds., 1998, 247–258.
R. Deaton, M. Garzon, R. Murphy, D.R. Franceschetti, and S.E. Stevens. Genetic search of reliable encodings for DNA-based computation, First Conference on Genetic Programming GP-96, Stanford U., 1996, 9–15.
M. Garzon, R. Deaton, P. Neathery, D.R. Franceschetti, and R.C. Murphy. A new metric for DNA computing. Proc. 2nd Genetic Programming Conference, Stanford, CA, 1997, Morgan-Kaufmann, 472–478.
M. Garzon, R. Deaton, L.F. Nino, S.E. Stevens, Jr., and M. Wittner. Genome encoding for DNA computing. Proc. 3rd Genetic Programming Conference, Madison, WI, 1998, 684–690.
T. Harju and J. Karhumäki. Morphisms. In Handbook of Formal Languages, vol. 1, G. Rozenberg, A. Salomaa, Eds., Springer-Verlag, Berlin, 1997, 439–510.
T. Head. Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors. Bulletin of Mathematical Biology 49 (1987), 737–759.
H. Jürgensen and S. Konstantinidis. Codes. In Handbook of Formal Languages, vol. 1, G. Rozenberg and A. Salomaa, Eds., Springer-Verlag, Berlin, 1997, 511–607.
L. Kari. DNA computing: arrival of biological mathematics. The Mathematical Intelligencer, vol. 19, no. 2, Spring 1997, 9–22.
L. Kari, R. Kitto, and G. Thierrin. Codes, involutions and DNA encoding. Workshop on Coding Theory, London, Ontario, July 2000. To appear.
A. Marathe, A. Condon, and R. Corn. On combinatorial DNA word design. DNA based Computers V, DIMACS Series, E. Winfree, D. Gifford, Eds., AMS Press, 2000, 75–89.
G. Paun, G. Rozenberg, and A. Salomaa. DNA Computing: New Computing Paradigms, Springer-Verlag, Berlin, 1998.
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 paper
Cite this paper
Hussini, S., Kari, L., Konstantinidis, S. (2002). Coding Properties of DNA Languages. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_6
Download citation
DOI: https://doi.org/10.1007/3-540-48017-X_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43775-8
Online ISBN: 978-3-540-48017-4
eBook Packages: Springer Book Archive