2014 | OriginalPaper | Chapter
Reversible Codes and Applications to DNA
Authors : Elif Segah Oztas, Irfan Siap, Bahattin Yildiz
Published in: Mathematical Software – ICMS 2014
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this study we focus on codes over a special family of commutative rings where we are able to construct a map that gives a correspondence between
k
-bases (
k
-letter words) of DNA with elements of the ring. By making use of so called coterm polynomials, we are able to solve the reversibility and complement problems in DNA codes and construct DNA codes over this ring.