2000 character limit reached
On Cyclic DNA Codes
Published 20 Sep 2012 in cs.IT, math.IT, and q-bio.OT | (1209.4414v3)
Abstract: This paper considers cyclic DNA codes of arbitrary length over the ring $R=\F_2[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. Cyclic codes over $R$ are designed such that their images under the mapping are also cyclic or quasi-cyclic of index 2. The additive distance and hybridization energy are functions of the neighborhood energy.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.