Exordium for DNA codes

DOI10.1023/B:JOCO.0000017385.39168.0dzbMath1058.92018MaRDI QIDQ1768590

Pavel A. Vilenkin, Anthony J. Macula, Vyacheslav V. Rykov, Arkadii G. D'yachkov, Péter L. Erdős, P. Scott White, Chang-Shung Tung, David C. Torney

Publication date: 15 March 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:joco.0000017385.39168.0d

zbMATH Keywords

DNA computing; formulation; DNA hybridization; directed design; binding propensity; digital velcro

Mathematics Subject Classification ID

68R15: Combinatorics on words

92C40: Biochemistry, molecular biology

92D20: Protein sequences, DNA sequences

Related Items

DNA Codes Based on Stem Similarities Between DNA Sequences, Reversible complement cyclic codes over ℤ4 + uℤ4 + vℤ4 for DNA computing, Cyclic DNA codes over the ring \(F_2[u/(u^2-1)\) based on the deletion distance], Construction of DNA codes by using algebraic number theory, Cyclic DNA codes over the ring \(\mathbb {F}_2+u\mathbb {F}_2+v\mathbb {F}_2+uv\mathbb {F}_2+v^2\mathbb {F}_2+uv^2\mathbb {F}_2\), DNA codes for nonadditive stem similarity, Construction of cyclic DNA codes over the ring \(\mathbb{Z}_4 [u / \langle u^2 - 1 \rangle\) based on the deletion distance], On DNA codes, Reverse–Complement Similarity Codes, On a generalization of lifted polynomials over finite fields and their applications to DNA codes