Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm

被引：3

作者：

Dougherty, Steven T. ^{[1
]}

Korban, Adrian ^{[2
]}

Sahinkaya, Serap ^{[3
]}

Ustun, Deniz ^{[4
]}

机构：

[1] Univ Scranton, Dept Math, Scranton, PA 18518 USA

[2] Univ Chester, Dept Phys Math & Engn Sci, Chester CH1 4AR, England

[3] Tarsus Univ, Fac Engn, Dept Nat & Math Sci, TR-33400 Mersin, Turkiye

[4] Tarsus Univ, Fac Engn, Dept Comp Engn, TR-33400 Mersin, Turkiye

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2023年 / 69卷 / 03期

关键词：

DNA; Codes; Hamming distances; Linear codes; DNA computing; Libraries; Thermodynamics; DNA codes; conflict free DNA codes; group rings; composite matrices; CONSTANT GC-CONTENT; MOLECULAR COMPUTATION; LINEAR CONSTRUCTIONS; HAMMING DISTANCE; LOWER BOUNDS; STORAGE; FAMILY;

D O I：

10.1109/TIT.2022.3217518

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1588 / 1603

页数：16