Biomolecular computing and programming

IEEE Transactions on Evolutionary Computation

Volumn 3, Issue 3, 1999, Pages 236-250

  Garzon, Max H ^a   Deaton, Russell J ^a  

^a UNIVERSITY OF MEMPHIS   (United States)

Author keywords

Biomolecular computing; DNA computing; Evolutionary computation; Nanoscale

Indexed keywords

EID: 0001172709     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.788493     Document Type: Article

References (15)

1. L. Adleman, "Molecular computation of solutions of combinatorial problems," Science, vol. 266, pp. 1021-1024, 1994.
2. M. R. Garey and D. S. Johnson, Computers and Intractability. New York: Freeman, 1979.
3. L. Landweber and L. Kari, "The evolution of cellular computing: Nature's solution to a computational problem," in Proc. Fourth DIMACS Workshop DNA Computers, H. Rubin and D. Wood, Eds., Univ. of Pennsylvania, Philadelphia, 1998, pp. 3-13.
4. A. Cukras, D. Faulhammer, R. Lipton, and L. Landweber, "Chess games: A model for RNA-based computation," in Proc. Fourth DIMACS Workshop DNA Computers, H. Rubin and D. Wood, Eds., Univ. of Pennsylvania, Philadelphia, 1998, pp. 15-26.
5. D. Faulhammer, A. Cukras, R. Lipton, and L. Landweber, "When the Knight falls: On constructing an RNA computer," in Proc. Fifth International Meeting on DNA Based Computers (DIMACS Series in Discrete Mathematics and Theoretical Computer Science), E. Winfree and D. Gifford, Eds. Providence, RI: Amer. Math. Soc., in press.
6. R. Birge, "Protein-based three-dimensional memory," Amer. Sci., vol. 82, pp. 348-355, 1994.
7. _, "Protein-based computers," Sci. Amer., 1995.
8. A. D. Ellington, M. P. Robertson, K. D. James, and J. C. Fox, "Strategies for DNA computing," in Proc. Third DIMACS Workshop on DNA-Based Computers (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 48), H. Rubin and D. Wood, Eds. Providence, RI: Amer. Math. Soc., 1999, pp. 173-184.
9. M. P. Robertson, J. Hesselberth, J. C. Fox, and A. D. Ellington, "Designing and selecting components for nucleic acid computers," in Proc. Fifth International Meeting on DNA Based Computers (DIMACS Series in Discrete Mathematics and Theoretical Computer Science), E. Winfree and D. Gifford, Eds. Providence, RI: Amer. Math. Soc., in press.
10. E. T. Kool, "New molecular strategies for joining, pairing, and amplifying," in DNA Based Computers II. Proc. Second DIMACS Workshop on DNA-Based Computers, (DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 44), L. F. Landweber and E. B. Baum, Eds. Providence, RI: Amer. Math. Soc., 1999.
11. J. D. Watson, N. H. Hopkins, J. W. Roberts, J. A. Steitz, and A. M. Weiner, Molecular Biology of the Gene, 4th ed. Menlo Park, CA: Benjamin/Cummings, 1987.
12. F. M. Ausubel, R. Brent, R. E. Kingston, D. D. Moore, J. G. Seidman, J. A. Smith, K. Struhl, P. Wang-Iverson, and S. G. Bonitz, Current Protocols in Molecular Biology. New York: Greene and Wiley-Interscience, 1993.
13. T. Head, "Formal language theory and DNA: An analysis of the generative capacity of specific recombination behaviors," Bull. Math. Biol., pp. 49-73, 1985.
14. L. Landweber, R. Lipton, R. Dorit, and A. Ellington (organizers), in Proc. DIMACS Workshop on Nucleic Acid Selection and Computing, Princeton Univ., Princeton, NJ, Mar. 1998.
15. Q. Ouyang, P. D. Kaplan, S. Liu, and A. Libchaber, "DNA solution of the maximal clique problem," Science, vol. 278, pp. 446-449, 1997.