Advertisement

Coding Properties of DNA Languages

  • Salah Hussini
  • Lila Kari
  • Stavros Konstantinidis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2340)

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

Regular Expression Regular Language Computation Language Code Property Splice System 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Berstel and D. Perrin. Theory of Codes, Academic Press, Inc., Orlando, Florida, 1985.zbMATHGoogle Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    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.Google Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    T. Head. Formal language theory and DNA: an analysis of the generative capacity of recombinant behaviors. Bulletin of Mathematical Biology 49 (1987), 737–759.zbMATHMathSciNetGoogle Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    L. Kari. DNA computing: arrival of biological mathematics. The Mathematical Intelligencer, vol. 19, no. 2, Spring 1997, 9–22.zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    L. Kari, R. Kitto, and G. Thierrin. Codes, involutions and DNA encoding. Workshop on Coding Theory, London, Ontario, July 2000. To appear.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    G. Paun, G. Rozenberg, and A. Salomaa. DNA Computing: New Computing Paradigms, Springer-Verlag, Berlin, 1998.zbMATHGoogle Scholar
  13. 13.
    H.J. Shyr, Free Monoids and Languages, Hon Min Book Company, Taichung, Taiwan, R.O.C., 1991.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Salah Hussini
    • 1
  • Lila Kari
    • 2
  • Stavros Konstantinidis
    • 1
  1. 1.Department of Mathematics and Computing ScienceSaint Mary’s UniversityHalifaxCanada
  2. 2.Department of Computer ScienceUniversity of Western OntarioLondonCanada

Personalised recommendations