Exordium for DNA Codes

D'yachkov, Arkadii G. and Erdős, Péter L. and Macula, Anthony J. and Rykov, Vyacheslav V. and Torney, David C. (2003) Exordium for DNA Codes. JOURNAL OF COMBINATORIAL OPTIMIZATION, 7 (4). pp. 369-379. ISSN 1382-6905

[img] Text
Restricted to Repository staff only

Download (206kB) | Request a copy


We describe how deletion-correcting codes may be enhanced to yield codes with double-strand DNA-sequence codewords. This enhancement involves abstractions of the pertinent aspects of DNA; it nevertheless ensures specificity of binding for all pairs of single strands derived from its codewords-the key desideratum of DNA codes- i.e. with binding feasible only between reverse complementary strands. We defer discussing the combinatorial-optimization superincumbencies of code construction. Generalization of deletion similarity to an optimal sequence-alignment score could readily effect advantageous improvements (Kaderali, Master's Thesis, Informatics, U. Köln, 2001) but would render the combinatorics opaque. We mention motivating applications of DNA codes.

Item Type: Article
Uncontrolled Keywords: DNA; Molecular Biology; Mathematical models; Genetic engineering; Computational methods; Combinatorial mathematics; amino acids; Formulation; DNA HYBRIDIZATION; DNA computing; Directed design; Digital velcro; Binding propensity
Subjects: Q Science / természettudomány > QA Mathematics / matematika
Depositing User: MTMT SWORD
Date Deposited: 06 Feb 2014 09:21
Last Modified: 06 Feb 2014 09:21

Actions (login required)

Edit Item Edit Item