Abstract
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesired behaviour, especially they should not form secondary structures. Various combinatorial properties like repetition-freeness and involution-freeness have been proposed to exclude such misbehaviour. Another option, which has been considered, is requiring a big Hamming distance between the codewords.
We propose to consider partial words for the solution of the coding problem. They, in some sense, already include the Hamming distance in the definition of compatibility and are investigated for many combinatorial properties. Thus, they can be used to guarantee a desired distance and simultaneously other properties. As the investigations on partial words are attracting more and more attention, they might be able to provide an ever-growing toolbox for finding good DNA encodings.
This is a preview of subscription content, log in via an institution to check access.
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
Andronescu, M., Dees, D., Slaybaugh, L., Zhao, Y., Condon, A.E., Cohen, B., Skiena, S.: Algorithms for Testing That Sets of DNA Words Concatenate without Secondary Structure. In: [10], pp. 182–195.
Brauer, W., Ehrig, H., Salomaa, A., Karhumäki, J. (eds.): Formal and Natural Computing. LNCS, vol. 2300. Springer, Heidelberg (2002)
Berstel, J., Boasson, L.: Partial Words and a Theorem of Fine and Wilf. Theoretical Computer Science 218, 135–141 (1999)
Berstel, J., Perrin, D.: Theory of Codes. Academic Press, London (1985)
Blanchet-Sadri, F.: Primitive Partial Words (2003) (Preprint)
Blanchet-Sadri, F.: Codes, Orderings, and Partial Words (2003) (Preprint)
Blanchet-Sadri, F., Hegstrom, A.: Partial Words and a Theorem of Fine and Wilf Revisited. Theoretical Computer Science 270(1/2), 401–419 (2002)
Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943. Springer, Heidelberg (2004)
Deaton, R., Garzon, M., Murphy, R.C., Rose, J.A., Franceschetti, D.R., Stevens Jr., S.E.: On the Reliability and Efficiency of a DNA-based Computation. Physical Review Letters 80(2), 417–420 (1998)
Hagiya, M., Ohuchi, A. (eds.): DNA 2002. LNCS, vol. 2568. Springer, Heidelberg (2003)
Hussini, S., Kari, L., Konstantinidis, S.: Coding Properties of DNA Languages. Theoretical Computer Science 290, 1557–1579 (2003)
Jonoska, N., Mahalingam, K.: Languages of DNA Based Code Words. In: [8], pp. 61–73
Kari, L., Kitto, R., Thierrin, G.: Codes, Involutions and DNA Encodings. In: [2], pp.376–393
Kari, L., Konstantinidis, S., Losseva, E., Wozniak, G.: Sticky-free and Overhang-free DNA Languages. Acta Informatica 40(2), 119–157 (2003)
Leupold, P.: Languages of Partial Words (submitted)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Shur, A.M., Gamzova, Y.V.: Periods’ Interaction Property for Partial Words. In: Preproceedings of Words 2003. TUCS General Publications, Turku (2003)
Shyr, H.J.: Free Monoids and Languages. Hon Min Book Company, Taichung (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leupold, P. (2005). Partial Words for DNA Coding. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_20
Download citation
DOI: https://doi.org/10.1007/11493785_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)