Characterizing DNA Bond Shapes Using Trajectories

• Autorzy: Domaratzki M.
• Języki publikacji: EN

Abstrakty

EN

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 a new definition of bondfreeness, 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 DNA 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.

Słowa kluczowe

EN

DNA computing; DNA trajectories

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2008
• Tom: Vol. 87, nr 3-4
• Strony: 269--285
• Opis fizyczny: bibliogr. 16 poz., wykr.

Twórcy

autor

Domaratzki M.

• Department of Computer Science, University of Manitoba, Winnipeg, MB, R3T 2T2, Canada,

Bibliografia

• [1] Adleman, L.: Molecular Computation of solutions to combinatorial problems, Science, 266, 1994, 1021-1024.
• [2] Amos, M.: Theoretical and Experimental DNA Computation, Springer, 2005.
• [3] Domaratzki, M.: Characterizing DNA bond shapes using trajectories, Developments in Language Theory (O. Ibarra, Z. Dang, Eds.), Lecture Notes in Computer Science 4036, Springer, 2006.
• [4] Domaratzki, M.: Hairpin Structures defined by DNA Trajectories, DNA 12 (C. Mao, T. Yokomori, Eds.), Lecture Notes in Computer Science 4287, Springer, 2006.
• [5] Harju, T., Karhumäki, J.: Morphisms, Handbook of Formal Languages, Vol. I, 1997.
• [6] Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages, Theor. Comp. Sci., 290(3), 2002, 1557-1579.
• [7] Jonoska, N., Kephart, D., Mahalingam, K.: Generating DNA code words, Congressus Numerantium, 156, 2002, 99-110.
• [8] Kari, L., Kitto, R., Thierrin, G.: Codes, involutions and DNA encoding, Formal and Natural Computing (W. Brauer, H. Ehrig, J. Harumäki, A. Salomaa, Eds.), Lecture Notes in Computer Science 2300, Springer, 2003.
• [9] Kari, L., Konstantinidis, S., Losseva, E., Sosík, P., Thierrin, G.: Hairpin Structures in DNA Words, DNA Computing (A. Carbone, N. Pierce, Eds.), Lecture Notes in Computer Science 3892, Springer, 2006.
• [10] Kari, L., Konstantinidis, S., Losseva, E., Wozniak, G.: Sticky-free and overhang-free DNA languages, Acta Inform., 40, 2003, 119-157.
• [11] Kari, L., Konstantinidis, S., Sosík, P.: Bond-free Languages: Formalisms, Maximality and Construction Methods, Int. J. Found. Comp. Sci., 16, 2005, 1039-1070.
• [12] Kari, L., Konstantinidis, S., Sosík, P.: On properties of bond-free DNA languages, Theor. Comp. Sci., 334, 2005, 131-159.
• [13] Kari, L., Konstantinidis, S., Sosík, P., Thierrin, G.: On hairpin-free words and languages, Developments in Language Theory: 9th International Conference (C. Felice, A. Restivo, Eds.), Lecture Notes in Computer Science 3572, Springer, 2005.
• [14] Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: Syntactic constraints, Theor. Comp. Sci.,197, 1998, 1-56.
• [15] Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms, Springer, 1998.
• [16] Rozenberg, G., Salomaa, A., Eds.: Handbook of Formal Languages, Springer, 1997.