On DNA codes

Problems of Information Transmission

Volumn 41, Issue 4, 2005, Pages 349-367

  D'yachkov, A G ^a   Vilenkin, P A ^a   Ismagilov, I K ^a   Sarbaev, R S ^a   Macula, A ^b   Torney, D ^c   White, S ^c  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b AIR FORCE RESEARCH LABORATORY   (United States)

^c LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DNA SEQUENCES; ENCODING (SYMBOLS); ERROR DETECTION; MATHEMATICAL MODELS; PROBABILITY; SET THEORY;

DNA CODES; PARITY CHECK ONE ERROR DETECTING CODE; RANDOM CODING METHOD;

CODES (SYMBOLS);

EID: 31344476085     PISSN: 00329460     EISSN: 16083253     Source Type: Journal    
DOI: 10.1007/s11122-006-0004-3     Document Type: Article

References (13)

1. D'yachkov, A.G., Erdõs, P.L., Macula, A.J., Rykov, V.V., Torney, D.C., Tung, C.-S., Vilenkin, P.A., and White, P.S., Exordium for DNA Codes, J. Combin. Optimization, 2003, vol. 7, no.4, pp. 369-379.
2. D'yachkov, A.G., Macula, A.J., Pogozelski, W.K., Renz, T.E., Rykov, V.V., and Torney, D.C., A Weighted Insertion-Deletion Stacked Pair Thermodynamic Metric for DNA Codes, in Proc. 10th Int. Workshop on DNA Computing, Milan, Italy, 2004, pp. 90-103.
3. D'yachkov, A.G., Torney, D.C., Vilenkin, P.A., and White, P.S., On a Class of Codes for Insertion-Deletion Metric, in Proc. 2002 IEEE Int. Symp. on Information Theory, Lausanne, Switzerland, 2002, pp. 372.
4. Levenshtein, V.I., Binary Codes Capable of Correcting Deletions, Insertions, and Reversals, Dokl. Akad. Nauk SSSR, 1965, vol. 163, no.4, pp. 845-848 [Soviet Phys. Dokl. (Engl. Transl.), 1966, vol. 10, no. 8, pp. 707-710].
5. Levenshtein, V.I., Elements of Coding Theory, in Diskretnaya matematika i matematicheskie voprosy kibernetiki (Discrete Mathematics and Mathematical Problems of Cybernetics), Moscow: Nauka, 1974, pp. 207-305.
6. Levenshtein, V.I., Efficient Reconstruction of Sequences from Their Subsequences and Supersequences, J. Combin. Theory, Ser. A, 2001, vol. 93, no.2, pp. 310-332.
7. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz', 1979.
8. D'yachkov, A.G. and Torney, D.C., On Similarity Codes, IEEE Trans. Inform. Theory, 2000, vol. 46, no.4, pp. 1558-1564.
9. Vilenkin, P.A., Asymptotic Problems of Combinatorial Coding Theory and Information Theory, Cand. Sci. (Phys.-Math.) Dissertation, Moscow: Moscow State Univ., 2000.
10. Adleman, L., Molecular Computation of Solutions to Combinatorial Problems, Science, 1994, vol. 266, pp. 1021-1024.
11. Dancik, V., Expected Length of Longest Common Subsequence, PhD Thesis, Univ. of Warwick, UK, 1994.
12. Tenengolts, G.M., Nonbinary Codes, Correcting Single Deletions or Insertions, IEEE Trans. Inform. Theory, 1984, vol. 30, no.5, pp. 766-769.
13. Levenshtein, V.I., Bounds for Deletion-Insertion Correcting Codes, in Proc. 2002 IEEE Int. Symp. on Information Theory, Lausanne, Switzerland, 2002, pp. 371.