2016/03/13 by Sukhamoy Pattanayak, Abhay Kumar Singh, Pattanayak, Sukhamoy +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Advanced biosensing and bioanalysis techniques #Cellular Automata and Applications #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1603.04055
15 pages, 3 tables. arXiv admin note: substantial text overlap with arXiv:1508.02015, arXiv:1511.03937
arxiv created 2016/03/13 · openalex publication_date 2016/03/13 · arxiv updated 2016/03/15 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
In this paper, we develop the theory for constructing DNA cyclic codes of odd length over R=\Z4[u]/⟨ u2-1 ⟩ based on the deletion distance. Firstly, we relate DNA pairs with a special 16 elements of ring R. Cyclic codes of odd length over R satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the GC-content of these codes and their deletion distance. The paper concludes with some examples of cyclic DNA codes with GC-content and their respective deletion distance.