On the design of codes for DNA computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3969 LNCS, Issue , 2006, Pages 100-119

  Milenkovic, Olgica ^a   Kashyap, Navin ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b QUEEN S UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; MAPPING; MATRIX ALGEBRA; PROBLEM SOLVING;

CROSS-HYBRIDIZATION; CYCLIC CODE CONSTRUCTIONS; DNA COMPUTING; SECONDARY STRUCTURE;

DNA;

EID: 33746718103     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779360_9     Document Type: Conference Paper

References (33)

1. T. Abualrub and A. Ghrayeb, "On the construction of cyclic codes for DNA computing," preprint.
2. L.M. Adleman, "Molecular computation of solutions to combinatorial problems," Science, vol. 266, pp. 1021-1024, Nov. 1994.
3. Y. Benenson, B. Gil, U. Ben-Dor, R. Adar and E. Shapiro, "An autonomous molecular computer for logical control of gene expression," Nature, vol. 429, pp. 423-429, May 2004.
4. D. Boneh, C. Dunworth, and R. Lipton, "Breaking DES using a molecular computer," Technical Report CS-TR-489-95, Department of Computer Science, Princeton University, USA, 1995.
5. R.S. Braich, N. Chelyapov, C. Johnson, P.W.K. Rothemund and L. Adleman, "Solution of a 20-variable 3-SAT problem on a DNA computer," Science, vol. 296, pp. 492-502, April 2002.
6. K. Breslauer, R. Frank, H. Blocker, and L. Marky, "Predicting DNA duplex stability from the base sequence," Proc. Natl. Acad. Sci. USA, vol. 83, pp. 3746-3750, 1986.
7. P. Clote and R. Backofen, Computational Molecular Biology - An Introduction, Wiley Series in Mathematical and Computational Biology, New York, 2000.
8. A. D'yachkov, P.L. Erdös, A. Macula, V. Rykov, D. Torney, C-S. Tung, P. Vilenkin and S. White, "Exordium for DNA codes," J. Comb. Optim., vol. 7, no. 4, pp. 369-379, 2003.
9. A. D'yachkov, A. Macula, T. Renz, P. Vilenkin and I. Ismagilov, "New results on DNA codes," Proc. IEEE Int. Symp. Inform. Theory (ISIT'05), Adelaide, Australia, pp. 283-287, Sept. 2005.
10. P. Gaborit and O.D. King, "Linear constructions for DNA codes, " Theoretical Computer Science, vol. 334, no. 1-3, pp. 99-113, April 2005.
11. I.P. Goulden and D.M. Jackson, Combinatorial Enumeration, Dover, 2004.
12. J.I. Hall, Lecture notes on error-control coding, available online at http://www.mth.msu.edu/~jhall/.
13. I. Heng and C.H. Cooke, "Polynomial construction of complex Hadamard matrices with cyclic core," Applied Mathematics Letters, vol. 12, pp. 87-93, 1999.
14. O.D. King, "Bounds for DNA codes with constant GC-content," The Electronic Journal of Combinatorics, vol. 10, no. 1, #R33, 2003.
15. V.I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals," Dokl. Akad. Nauk SSSR, vol. 163, no. 4, pp. 845-848, 1965 (Russian).
16. English translation in Soviet Physics Doklady, vol. 10, no. 8, pp. 707-710, 1966.
17. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
18. M. Mansuripur, P.K. Khulbe, S.M. Kuebler, J.W. Perry, M.S. Giridhar and N. Peyghambarian, "Information storage and retrieval using macromolecules as storage media," University of Arizona Technical Report, 2003.
19. A. Marathe, A. E. Condon and R. M. Corn, "On combinatorial DNA word design," J. Comput. Biol, vol. 8, pp. 201-219, 2001.
20. S. Mneimneh, "Computational Biology Lecture 20: RNA secondary structures," available online at engr.smu.edu/~saad/courses/cse8354/lectures/ lecture20.pdf.
21. O. Milenkovic, "Generalized Hamming and coset weight enumerators of isodual codes," accepted for publication in Designs, Codes and Cryptography.
22. O. Milenkovic and N. Kashyap, "DNA codes that avoid secondary structures," Proc. IEEE Int. Symp. Inform. Theory (ISIT'05), Adelaide, Australia, pp. 288-292, Sept. 2005.
23. R. Nussinov and A.B. Jacobson, "Fast algorithms for predicting the secondary structure of single stranded RNA ," Proc. Nail. Acad. Sci. USA, vol. 77, no. 11, pp. 6309-6313, 1980.
24. V. Rykov, A.J. Macula, D. Torney and P. White, "DNA sequences arid quaternary cyclic codes," in Proc. IEEE Int. Symp. Inform. Theory (ISIT'01), Washington DC, p. 248, June 2001.
25. D.D. Shoemaker, D.A. Lashkari, D. Morris, M. Mittman and R.W. David, "Quantitative phenotye analysis of yeast deletion mutants using a highly parallel molecular bar-coding strategy," Nature Genetics, vol. 16, pp. 450-456, Dec. 1996.
26. M.N. Stojanovic, D. Stefanovic, "A deoxyribozyme-based molecular automaton," Nature Biotechnology vol. 21, pp. 1069-1074, 2003.
27. M. Svanström, P.R.J. Östergard and G.T. Bogdanova, "Bounds and constructions for ternary constant-composition codes," IEEE Trans. Inform. Theory, vol. 48, no. 1, pp. 101-111, Jan. 2002.
28. S. Tsaftaris, A. Katsaggelos, T. Pappas and E. Papoutsakis, "DNA computing from a signal processing viewpoint," IEEE Signal Processing Magazine, pp. 100-106, Sept. 2004.
29. K.K. Tzeng and K.P. Zimmerrnanri, "On extending Goppa codes to cyclic codes," IEEE Trans. Inform. Theory, vol. IT-21, pp. 712-716, Nov. 1975.
30. The Vienna RNA Secondary Structure Package, http://rna.tbi.univie.ac.at/ cgi-bin/RNAfold.cgi.
31. E. Winfree, "DNA computing by self-assembly," The Bridge, vol. 33, no. 4, pp. 31-38, 2003. Also available online at http://www.dna.caltech.edu/Papers/ FOE_2003_final.pdf.
32. D.H. Wood, "Applying error correcting codes to DNA computing," in Proc. 4th Int. Meeting on DNA Based Computers, 1998, pp. 109-110.
33. M. Zuker, "Mfold web server for nucleic acid folding and hybridization prediction," Nucleic Acids Res., vol. 31, no. 13, pp. 3406-15, 2003. Web access at http://www.bioinfo.rpi.edu/~zukerm/rna/.