Executing parallel logical operations with DNA

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 2, Issue , 1999, Pages 972-979

  Ogihara, Mitsunori ^a   Ray, Animesh ^b  

^a University of Rochester   (United States)

^b UNIVERSITY OF ROCHESTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DNA; PARALLEL ARCHITECTURES;

CHEMICAL PROCESS; DNA COMPUTATION; DNA-COMPUTING; HAMILTON PATH; LOGICAL OPERATIONS; MASSIVELY PARALLEL COMPUTING; PARALLEL COMPUTATION; PARALLEL COMPUTATION MODEL;

BIOINFORMATICS;

EID: 84901428237     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.782528     Document Type: Conference Paper

References (40)

1. L. Adleman. Molecular computation of solutions to combinatorial problems. Science, 266:1021-1024, 1994.
2. L. Adleman, P. Rothemund, S. Roweis, and E. Winfree. On applying molecular computation to the Data Encryption Standard. In L. Landweber and E. Baum, editors, DNA Based Computers II, pages 31-44. AMS DIMACS Ser. Vol. 44, 1999.
3. B. Alberts, D. Bray, J. Lewis, M. Raff, K. Roberts, and J. Watson. Molecular Biology of the Cell. Garland Publishing Inc., New York, NY, 3rd edition, 1994.
4. M. Amos, P. E. Dunne, and A. Gibbons. DNA simulation of boolean circuits. In J. R. Koza et al. eds., Proc. 3rd Genet. Prog. Conference, pages 679-683, 1998. Morgan Kaufmann.
5. M. Amos and D. Hodgson. DNA simulation of boolean circuits. Res. Report CTAG-97009, University of Liverpool, Liverpool, UK, December 1997.
6. E. Bach, A. Condon, E. Glaser, and C. Tanguay. DNA models and algorithms for NP-complete problems. In Proc. 11th IEEE Conference on Comp. Complexity, pages 290-299, 1996.
7. E. Baum and D. Boneh. Running dynamic programming algorithms on a DNA computer. In L. Landweber and E. Baum, editors, DNA Based Computers II, pages 77-80. AMS DIMACS Ser. Vol. 44, 1999.
8. L. R. Bazemore, M. Takahashi, and C. M. Radding. Kinetic analysis of paring and strand exchange catalyzed by RecA. Detection by fluorescence energy transfer. J. Biol. Chem., 272:14672-14682, 1997.
9. R. Beigel and D. Eppstein. 3-coloring in time 0 (1.3446): a no-MIS algorithm. In Proc. 36th lEEEESymp. on Foundations of Computer Science, pages 444-453, 1995.
10. R. Beigel and B. Fu. Molecular computing, bounded nondeterminism, and efficient recursion. Tech. Report YALEU/DCS/TR-1116, Dept. Comp. Sci., Yale University, November 1996.
11. D. Boneh, C. Dunworth, and R. Lipton. Breaking DES using a molecular computer. In R. Lipton and E. Baum, editors, DNA Based Computers, pages 37-65. AMS DIMACS Ser. Vol. 27, 1996.
12. D. Boneh, C. Dunworth, R. Lipton, and J. Sgall. On the computational power of DNA. Disc. App. Math., 71:79-94, 1996.
13. C. R. Cantor and R. Schimmel. Biophysical Chemistry, volume 3. W. H. Freeman, 1980.
14. A. Caviani-Pease, D. Solas, E. Sullivan, M. Cronin, C. Holmes, and S. Fodor. Light-generated oligonucleotide arrays for rapid DNA sequence analysis. Proc. Natl. Acad. Sci., 91:5022-5026, 1994.
15. M. Chee, R. Yang, E. Hubbell, A. Berno, X. Huang, D. Stern, J. Winkler, D. Lockhart, M. Morris, and S. Fodor. Accessing genetic information with high density DNA arrays. Science, 274:610-614, 1996.
16. BC Crandall, editor. Nanotechnology. MIT Press, Cambridge, MA, 1996.
17. K. Drexler. Nanosystems. John Wiley & Sons, New York, NY, 1992.
18. R. Feynman. There's plenty of room at the bottom. In D. Gilbert, editor, Miniaturization, pages 282-296. Reingold, New York, 1961.
19. G. Gamow, A. Rich, and M. Yeas. The problem of information transfer from the nucleic acids to proteins. Adv. Biol. Med. Physics, 4:23-68, 1956.
20. D. Gonda and C. Radding. The mechanism of the search for homology by recA protein, facilitated diffusion within nucleoprotein networks. J. Biol. Chem., 261:13087-13096, 1986.
21. H. J. Hoover, M. M. Klawe, and N. J. Pippenger. Bounding fan-out in logical networks. J. ACM, 31(1):13-18, 1984.
22. P. Hsieh, C. S. Camerini-Otero, and R. D. Camerini-Otero. The synapsis event in the homlogous pairing of DNAs: RecA recognizes and pairs less than one helical repeat of DNA. Proc. Natl. Acad. Sci., 89:6492-6496, 1992.
23. L. Jen-Jacobson, L. E. Engler, D. R. Lesser, M. R. Kurpiewski, C. Yee, and B. McVerry. Structural adaptions in the interaction of EcoRI endonuclease with methylated GAATTC sites. EMBO J., 15:2870-2882, 1996.
24. L. Kari and L. Landweber. The evolution of DNA computing: nature's solution to a computational problem. In J. R. Koza et al. eds., Proc. 3rd Genet. Prog. Conference, pages 679-683, 1998. Morgan Kaufmann.
25. S. Kowalczykowski and A. Eggleston. Homologous pairing and DNA strand-exchange proteins. Ann. Rev. Biochem., 63:991-1043, 1994.
26. S. C. Kowalczykowski and A. K. Eggleston. Homologous pairing and DNA strand-exchange proteins. Ann. Rev. Biochem., 63:991-1043, 1994.
27. S. Kurtz, S. Mahaney, J. Royer, and J. Simon. Biological computing. In L. Hemaspaandra and A. Selman, editors, Complexity Theory Retrospective II, pages 179-195. Springer-Verlag, New York, NY, 1997.
28. R. Lipton. DNA solutions of hard computational problems. Science, 268:542-545, 1995.
29. n steps. Disc. App. Math., 10:287-295, 1985.
30. M. Ogihara. Breadth first search 3SAT algorithms for DNA computers. Tech. Report TR 629, Dept. Comp. Sci., Univ. Rochester, Rochester, NY, July 1996.
31. M. Ogihara and A. Ray. DNA-based parallel computation by counting. In Proc. 3rd DIMACS Workshop on DNA Based Computers, pages 265-274, 1997.
32. M. Ogihara and A. Ray. Simulating boolean circuits on DNA computers. In Proc. International Conference on Computational Molecular Biology, pages 326-331. ACM Press, 1997.
33. M. Ogihara and A. Ray. A DNA-based self-propagating algorithm for solving bounded-fan-in Boolean circuits. In J. R. Koza et al. eds., Proc. 3rd Genet. Prog. Conference, pages 679-683, 1998. Morgan Kaufmann.
34. M. Ogihara and A. Ray. The minimum DNA model and its computational power. In Unconventional Models of Computation, pages 309-322. Springer, Singapore, 1998.
35. J. Reif. Parallel molecular computation. In Proc. 7th ACM Symp. on Parallel Algorithms and Architechture, pages 213-223, 1995.
36. J. Sambrook, E. F. Fritsch, and T. Maniatis. Molecular Cloning: a Laboratory Manual. Cold Spring Harbor Press, NY, 2nd edition, 1989.
37. W. Smith. DNA computers in vitro and vivo. In R. Lipton and E. Baum, editors, DNA Based Computers, pages 121-185. AMS DIMACS Ser. Vol. 27, 1996.
38. J. van Lint. Introduction to coding theory. Springer-Verlag, 1991.
39. J. Watson, N. Hopkins, J. Roberts, J. Steiz, and A. Weiner. Molecular Biology of the Gene. Benjamin-Cummings, Menlo Part, CA, 4th edition, 1987.
40. X. Yu, E. Angov, R. Carmerini-Otero, and E. Egelman. Structural polymorphism of the RecA protein from the thermophilic bacterium Thermus aquaticus. Biophysical J., 69(6):2728-2738, 1995.