Exordium for DNA Codes

Journal of Combinatorial Optimization

Volumn 7, Issue 4, 2003, Pages 369-379

  D'yachkov, Arkadii G ^a   Erdös, Peter L ^b   Macula, Anthony J ^c   Rykov, Vyacheslav V ^d   Torney, David C ^e   Tung, Chang Shung ^e   Vilenkin, Pavel A ^a   White, P Scott ^f  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS   (Hungary)

^c STATE UNIVERSITY OF NEW YORK   (United States)

^d UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

^e LOS ALAMOS NATIONAL LABORATORY   (United States)

^f LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Binding propensity; Digital velcro; Directed design; DNA computing; DNA hybridization; Formulation

Indexed keywords

BINDING PROPENSITY; DIGITAL VELCRO; DIRECTED DESIGN; DNA COMPUTING; DNA HYBRIDIZATION; FORMULATION;

AMINO ACIDS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; GENETIC ENGINEERING; MATHEMATICAL MODELS; MOLECULAR BIOLOGY;

DNA;

EID: 1842739326     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:JOCO.0000017385.39168.0d     Document Type: Article

References (24)

1. L.M. Adleman, "Molecular computation of solutions to combinatorial problems," Science, vol. 266, pp. 1021-1024, 1994.
2. G.I. Bell and D.C. Torney, "Repetitive DNA sequences: Some considerations for simple sequence repeats," Computers and Chemistry, vol. 17, pp. 185-190, 1993.
3. K.J. Breslauer, R. Frank, H. Blocker, and L. A. Markey, "Predicting Duplex DNA Stability from the base sequence," PNAS USA, vol. 83, pp. 3746-3750, 1986.
4. H. Cai, P.S. White, D.C. Torney, A. Deshpande, Z. Wang, B. Marrone, and J.P. Nolan, "Flow cytometry-based minisequencing: A new platform for high throughput single nucleotide polymorphism scoring," Genomics, vol. 66, pp. 135-143, 2000.
5. C.J. Colbourn and J.H. Dinitz, The CRC Handbook of Combinatorial Designs. CRC Press: Boca Raton, 1996.
6. A.G. D'yachkov and D.C. Torney, "On similarity codes," IEEE Trans. on Information Theory, vol. 46, pp. 1558-1564, 2000.
7. A.G. D'yachkov, D.C. Torney, P.A. Vilenkin, and P.S. White, "Reverse - Complement similarity codes," IEEE Trans. on Information Theory, submitted.
8. P.L. Erdös, P. Ligeti, P. Sziklai, and D. C. Torney, "Subwords in reverse complement order," in preparation.
9. P.L. Erdös, D.C. Torney, and P. Sziklai, "A finite word poset," Elec. J. of Combinatorics, vol. 8, 2001.
10. H.D.L. Hollman, "A relation between Levenshtein-type distances and insertion and deletion correcting capabilities of codes," IEEE Trans. on Information Theory, vol. 39, pp. 1424-1427, 1993.
11. D.L. Johnson, Presentation of Groups, 2nd edition. London Mathematical Society Student Texts, Cambridge University Press: Cambridge, vol. 15, 1997.
12. L. Kaderali, "Selecting target specific probes for DNA arrays," Master's Thesis, Informatics, U. Köln, 2001.
13. L. Kaderali, A. Deshpande, J.P. Nolan, and P.S. White, "Primer-design for multiplexed genotyping," Nucleic Acids Research, vol. 31, pp. 1796-1802, 2003.
14. V.I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals," J. Soviet Phys. Doklady, vol. 10, pp. 707-710, 1966.
15. A. Marathe, A.E. Condon, and R.M. Com, "On combinatorial DNA design," J. Comp. Biol., vol. 8, pp. 201-219, 2001.
16. S.B. Needleman and C.D. Wunsch, "A general method applicable to the search for similarities in the amino-acid sequences of two proteins," J. Mol. Biol., vol. 48, pp. 443-453, 1970.
17. Q. Ouyang, P.D. Kaplan, S. Liu, and A. Libchaber, "DNA solution of the maximal clique problem," Science, vol. 278, pp. 446-449, 1997.
18. V.V. Rykov, A.J. Macula, C.M. Korzelius, D.C. Englehart, D.C. Torney, and P.S. White, "DNA sequences constructed on the basis of quaternary cyclic codes," in Proceedings of the 4th World Multiconference on Systematics, Cybernetics, and Informatics, SCI 2000/ISAS 2000, Orlando, Florida, July 2000.
19. K. Sakamoto, H. Gouzu, K. Komiya, D. Kiga, S. Yokoyama, T. Yokomori, and M. Hagiya, "Molecular computation by DNA hairpin formation," Science, vol. 288, pp. 1223-1226, 2000.
20. N. Shalaby, J.M. Wang, and J.X. Yin, "Existence of perfect 4-deletion-correcting-codes with length six," Designs, Codes and Cryptography, vol. 27, pp. 145-156, 2002.
21. T.F. Smith and M.S. Waterman, "Identification of common molecular subsequences," J. Mol Biol., vol. 147, pp. 195-197, 1981.
22. J.D. Ullman, "On the capabilities of codes to correct synchronization errors," IEEE IT, vol. 13, pp. 95-105, 1967.
23. R.R. Varšamov and G.M. Tenengol'ts, "One-asymmetrical-error correction codes (in Russian)," Avtomatika I Telemekhanika, vol. 26, pp. 288-292, 1965.
24. J. Yin, "A combinatorial construction for perfect deletion-correcting codes," Designs, Codes, and Cryptography, vol. 26, pp. 99-110, 2001.