Characterizing DNA Bond Shapes Using Trajectories

  • Michael Domaratzki
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4036)


We consider the use of DNA trajectories to characterize DNA bond shapes. This is an extension of recent work on the bond-free properties of a language. Using an new definition of bond-freeness, we show that we can increase the types of DNA bond shapes which are expressible. This is motivated by the types of bond shapes frequently found in DNA computing.

We examine the algebraic properties of sets of trajectories. In particular, we consider rotation of trajectories and weakening of the bonding conditions expressed by a set of DNA trajectories. We also consider decidability results for bond-freeness with respect to our definition.


Algebraic Property Regular Language Input Word Identity Morphism Morphic Involution 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 (1994)CrossRefGoogle Scholar
  2. 2.
    Amos, M.: Theoretical and Experimental DNA Computation. Springer, Heidelberg (2005)MATHGoogle Scholar
  3. 3.
    Domaratzki, M.: Hairpin structures defined by DNA trajectories. Technical Report TR-2006-001, Jodrey School of Computer Science, Acadia University (submitted for publication, 2006)Google Scholar
  4. 4.
    Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. Theor. Comp. Sci. 290(3), 1557–1579 (2002)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Jonoska, N., Kephart, D., Mahalingam, K.: Generating DNA code words. Congressus Numerantium 156, 99–110 (2002)MathSciNetGoogle Scholar
  6. 6.
    Kari, L., Kitto, R., Thierrin, G.: Codes, involutions and DNA encoding. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 376–393. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Kari, L., Konstantinidis, S., Losseva, E., Sosík, P., Thierrin, G.: Hairpin structures in DNA words. In: Carbone, A., Pierce, N.A. (eds.) DNA 2005. LNCS, vol. 3892, pp. 158–170. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Kari, L., Konstantinidis, S., Losseva, E., Wozniak, G.: Sticky-free and overhang-free DNA languages. Acta Inform. 40, 119–157 (2003)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kari, L., Konstantinidis, S., Sosík, P.: Bond-free languages: Formalisms, maximality and construction methods. Int. J. Found. Comp. Sci. 16, 1039–1070 (2005)MATHCrossRefGoogle Scholar
  10. 10.
    Kari, L., Konstantinidis, S., Sosík, P.: On properties of bond-free DNA languages. Theor. Comp. Sci. 334, 131–159 (2005)MATHCrossRefGoogle Scholar
  11. 11.
    Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints. Theor. Comp. Sci. 197, 1–56 (1998)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)MATHGoogle Scholar
  13. 13.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Heidelberg (1997)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michael Domaratzki
    • 1
  1. 1.Jodrey School of Computer ScienceAcadia UniversityWolfvilleCanada

Personalised recommendations