Biomolecular computing requires the use of carefully crafted DNA words. We compare and integrate two known different theoretical approaches 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 theta from [3]
Ferretti, C., Mauri, G. (2004). Remarks on relativisations and DNA encodings. In N. Jonoska, G. Paun, G. Rozenberg (a cura di), Aspects of Molecular Computing. Essays Dedicated to Tom Head, on the Occasion of His 70th Birthday (pp. 132-138). Berlin : Springer Verlag [10.1007/978-3-540-24635-0_9].
Remarks on relativisations and DNA encodings
FERRETTI, CLAUDIO;MAURI, GIANCARLO
2004
Abstract
Biomolecular computing requires the use of carefully crafted DNA words. We compare and integrate two known different theoretical approaches 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 theta from [3]
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
