Title :
On cyclic DNA codes
Author :
Guenda, K. ; Gulliver, T.A. ; Sole, Patrick
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Victoria, Victoria, BC, Canada
Abstract :
This paper considers cyclic DNA codes of arbitrary length over the ring R = F2[u]/(u4 - 1). A mapping is given between the elements of R and the alphabet {A, C, G, T} which allows the additive stem distance to be extended to this ring. Then, cyclic codes over R are designed such that their images under the mapping are also cyclic or quasi-cyclic of index 2 with designed hybridization energy. The hybridization energy and additive distance are shown to be functions of the neighborhood energy.
Keywords :
biocomputing; cyclic codes; genetic algorithms; additive distance; arbitrary length; cyclic DNA codes; designed hybridization energy; genetic programming; neighborhood energy functions; Additives; DNA; DNA computing; Genetic communication; Indexes; Polynomials;
Conference_Titel :
Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on
Conference_Location :
Istanbul
DOI :
10.1109/ISIT.2013.6620200
