Abstract
Biomolecular computing requires the use of carefully crafted DNA words. We compare and integrate two known different theoretical approaches ([2,3]) to the encoding problem for DNA languages: one is based on a relativization of concepts related to comma free codes, the other is a generalization to any given mapping θ of the notion of words appearing as substrings of others. Our first results show which parts of these two formalisms are in fact equivalent. The remaining remarks suggest how to define, to the benefits of laboratory experiments, properties of DNA encodings which merge relativization from [2] and the generality of θ from [3].
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
Berstel, J., Perrin, D.: Theory of Codes. Academic Press, London (1985)
Head, T.: Relativised code concepts and multi-tube DNA dictionaries (submitted 2002)
Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. Theoretical Computer Science 290, 1557–1579 (2003)
Jonoska, N., Kephart, D., Mahaligam, K.: Generating DNA code words. Congressum Numeratium 156, 99–110 (2002)
Jonoska, N., Mahalingam, K.: Languages of DNA code words. In: Preliminary Proceedings of DNA 9 Conference, pp. 58–68 (2003)
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)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. New Computing Paradigms. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ferretti, C., Mauri, G. (2003). Remarks on Relativisations and DNA Encodings. In: Jonoska, N., Păun, G., Rozenberg, G. (eds) Aspects of Molecular Computing. Lecture Notes in Computer Science, vol 2950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24635-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-24635-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20781-8
Online ISBN: 978-3-540-24635-0
eBook Packages: Springer Book Archive