Preventing Undesirable Bonds Between DNA Codewords
The input data for DNA computing must be encoded into the form of single or double DNA strands. As complementary parts of single strands can bind together forming a double-stranded DNA sequence, one has to impose restrictions on these sets of DNA words (=languages) to prevent them from interacting in undesirable ways. We recall a list of known properties of DNA languages which are free of certain types of undesirable bonds. Then we introduce a general framework in which we can characterize each of these properties by a solution of a uniform formal language inequation. This characterization allows us among others to construct (i) a uniform algorithm deciding in polynomial time whether a given DNA language possesses any of the studied properties, and (ii) in many cases also an algorithm deciding whether a given DNA language is maximal with respect to the desired property.
KeywordsRegular Language Quadratic Time Maximal Subset Phrase Degree Language Property
Unable to display preview. Download preview PDF.
- 2.Domaratzki, M.: Deletion Along Trajectories. Tech. Report 464-2003, School of Computing, Queen’s University (2003) (submitted for publication)Google Scholar
- 3.Head, T.: Relativised code concepts and multi-tube DNA dictionaries. In: Calude, C.S., Păun, G. (eds.) Finite Versus Infinite: Contributions to an Eternal Dilemma, pp. 175–186. Springer, London (2000)Google Scholar
- 7.Kari, L.: On insertion and deletion in formal languages, PhD thesis, University of Turku, Finland (1991)Google Scholar
- 9.Kari, L., Konstantinidis, S.: Language equations, maximality and error detection (submitted for publication)Google Scholar
- 11.Kari, L., Konstantinidis, S., Sosík, P.: On Properties of Bond-Free DNA Languages. Dept. of Computer Science Tech. Report No. 609, Univ. of Western Ontario (2003) (submitted for publication)Google Scholar
- 12.Kari, L., Sosík, P.: Language deletion on trajectories. Dept. of Computer Science Technical Report No. 606, University of Western Ontario, London (2003)Google Scholar
- 13.Marathe, A., Condon, A.E., Corn, R.M.: On combinatorial DNA words design. J. Computational Biology 8(3) (2001)Google Scholar