Natural Computing

, Volume 5, Issue 2, pp 127–149 | Cite as

The Construction of Minimal DNA Expressions

  • Rudy Van Vliet
  • Hendrik Jan Hoogeboom
  • Grzegorz Rozenberg
Article

Abstract

We describe a formal language/notation for DNA molecules that may contain nicks and gaps. The elements of the language, DNA expressions, denote formal DNA molecules. Different DNA expressions may denote the same formal DNA molecule. We analyse the shortest DNA expressions denoting a given formal DNA molecule. We determine lower bounds on their lengths and explain how we construct these minimal DNA expressions.

Keywords

constructions DNA molecules formal language minimal DNA expressions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adleman, LM 1994Molecular computation of solutions to combinatorial problemsScience26610211024Google Scholar
  2. Boneh, D, Dunworth, C, Lipton, RJ 1996

    Breaking DES using a molecular computer

    Lipton, RJBaum, EB eds. DNA Based Computers, Proceedings of a DIMACS workshop, April 4, 1995Princeton University, American Mathematical SocietyProvidence, RI3766
    Google Scholar
  3. Chen, JReif, J eds. 2004DNA Computing, 9th International workshop on DNA based computers, DNA9, Madison, WI, USA, June 1–3, 2003, Revised Papers, LNCS 2943Springer-VerlagBerlinGoogle Scholar
  4. Ferretti, CMauri, GZandron, C eds. 2005DNA Computing, 10th International workshop on DNA computing, DNA10, Milan, Italy, June 7–10, 2004, Revised Selected Papers, LNCS 3384Springer-VerlagBerlinGoogle Scholar
  5. Head, T 1987Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviorsBulletin of Mathematical Biology49737759MATHMathSciNetCrossRefGoogle Scholar
  6. Li Z (1999) Algebraic properties of DNA operations. In: Kari L, Rubin H and Wood DH (eds) Proceedings of the fourth international meeting on DNA based computers, University of Pennsylvania, Philadelphia, USA, June 15–19, 1998, BioSystems 52: 55–61Google Scholar
  7. Păun, Gh, Rozenberg, G, Salomaa, A 1998DNA Computing – New Computing ParadigmsSpringer-VerlagBerlinGoogle Scholar
  8. Rivas, E, Eddy, SR 2000The language of RNA: a formal grammar that includes pseudoknotsBioinformatics16334340CrossRefGoogle Scholar
  9. van Vliet R (2004) Combinatorial aspects of minimal DNA expressions (ext.). Technical Report 2004–03, Leiden Institute of Advanced Computer Science, Leiden University, see www.liacs.nl/home/rvvliet/mindnaexpr.htmlGoogle Scholar
  10. van Vliet R, Hoogeboom HJ and Rozenberg G (2005) Combinatorial aspects of minimal DNA expressions. In: Ferretti C, Mauri G, Zandron C (eds) DNA Computing, 10th International workshop on DNA computing, DNA10, Milan, Italy, June 7-10, 2004, Revised Selected Papers, LNCS 3384. Springer-Verlag, Berlin, pp. 375–388Google Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  • Rudy Van Vliet
    • 1
  • Hendrik Jan Hoogeboom
    • 1
  • Grzegorz Rozenberg
    • 1
    • 2
  1. 1.Leiden Institute of Advanced Computer Science (LIACS)Leiden UniversityLeidenThe Netherlands
  2. 2.Department of Computer ScienceUniversity of Colorado at BoulderBoulderUSA

Personalised recommendations