Exordium for DNA codes
From MaRDI portal
Publication:1768590
DOI10.1023/B:JOCO.0000017385.39168.0dzbMath1058.92018OpenAlexW1964440534MaRDI 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
Combinatorics on words (68R15) Biochemistry, molecular biology (92C40) Protein sequences, DNA sequences (92D20)
Related Items (10)
On a generalization of lifted polynomials over finite fields and their applications to DNA codes ⋮ 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\) ⋮ Construction of cyclic DNA codes over the ring \(\mathbb{Z}_4 [u / \langle u^2 - 1 \rangle\) based on the deletion distance] ⋮ Reversible complement cyclic codes over ℤ4 + uℤ4 + vℤ4 for DNA computing ⋮ Construction of DNA codes by using algebraic number theory ⋮ On DNA codes ⋮ Cyclic DNA codes over the ring \(F_2[u/(u^2-1)\) based on the deletion distance] ⋮ DNA codes for nonadditive stem similarity ⋮ DNA Codes Based on Stem Similarities Between DNA Sequences ⋮ Reverse–Complement Similarity Codes
This page was built for publication: Exordium for DNA codes
