1 Ocak 2023 Dergi makalesi Açık Erişim

Dougherty, Steven T.; Korban, Adrian; Sahinkaya, Serap; Ustun, Deniz

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Dougherty, Steven T.</dc:creator>
  <dc:creator>Korban, Adrian</dc:creator>
  <dc:creator>Sahinkaya, Serap</dc:creator>
  <dc:creator>Ustun, Deniz</dc:creator>
  <dc:date>2023-01-01</dc:date>
  <dc:description>In this work, we present a new construction method for reversible codes. We employ composite matrices derived from group rings and show how to construct these matrices so that they are also reversible. Also in this work, we give an algorithm for calculating conflict free DNA codes that satisfy the Hamming distance, the reverse, the reverse-complement, the GC-content constraints with each DNA codeword being free from reverse complement sub-strings. By employing our construction method for reversible codes and our algorithm, we construct a number of DNA codes that satisfy the above constraints. Many of the codes we obtain have better parameters than some known DNA codes and many have parameters that are new to the literature.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/273382</dc:identifier>
  <dc:identifier>oai:aperta.ulakbim.gov.tr:273382</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>IEEE TRANSACTIONS ON INFORMATION THEORY 69(3) 16</dc:source>
  <dc:title>Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>