Reversible codes and applications to DNA

Elif Segah Oztas, Irfan Siap, Bahattin Yildiz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


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.

Original languageEnglish (US)
Title of host publicationMathematical Software, ICMS 2014 - 4th International Congress, Proceedings
Number of pages5
ISBN (Print)9783662441985
StatePublished - 2014
Externally publishedYes
Event4th International Congress on Mathematical Software, ICMS 2014 - Seoul, Korea, Republic of
Duration: Aug 5 2014Aug 9 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8592 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference4th International Congress on Mathematical Software, ICMS 2014
Country/TerritoryKorea, Republic of


  • Coterm polynomials
  • DNA codes
  • Reversible-complement codes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Reversible codes and applications to DNA'. Together they form a unique fingerprint.

Cite this