On the Reversibility Problem for DNA 4-bases
Abstract
By defining a non-trivial automorphism over R=Z_4+uZ_4+vZ,_4+uvZ_4 where u^2=u, v^2=v, uv=vu and Z_4={0,1,2,3}, the skew cyclic codes over the finite ring R are introduced. By using the skew cyclic codes over R, it is solved the reversibility problem for DNA 4-bases. Thanks to this, the reversible DNA codes are obtained.
Keywords
References
- Adleman L. 1994. “Molecular computation of the solutions to combinatorial problems”, Science, 266,1021-1024.
- Bayram A., Oztas E., Siap I. 2015. “Codes over and some DNA applications”, Designs, Codes and Cryptography, DOI: 10.107/s10623-015-01008.
- Cengellenmis Y., Dertli A. 2019. “On the skew cyclic codes and the reversibility problem for DNA 4-bases”, Mathematics in Computer Science, to be accepted.
- Dertli A., Cengellenmis Y. 2017. “On cyclic DNA codes over the rings and ”, Biomath, 6, 1712167.
- Gursoy F., Oztas S. E., Siap I. 2017. “Reversible DNA codes over ”, American Institude of Mathematical Sciences, 11, 307-312.
- Gursoy F., Oztas S. E.,Ozkan A. 2017. “Reversible DNA codes over a family of non-chain ring”, arXiv:1711.02385v1.
- Head, T. 1987. “Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors”, Bulletin of mathematical biology, 49, 737-759.
- Kumar, N., Singh A. K. 2018. “DNA computing over the ring ”, International Journal of Biomathematics , 11, 1850090.
Details
Primary Language
English
Subjects
-
Journal Section
Research Article
Authors
Yasemin Çengellenmiş
This is me
0000-0002-8133-9836
Türkiye
Abdullah Dertli
*
0000-0001-8687-032X
Türkiye
Publication Date
December 31, 2020
Submission Date
October 21, 2019
Acceptance Date
September 17, 2020
Published in Issue
Year 2020 Volume: 13 Number: 3