The bounded complexity of DNA computing

BioSystems

Volumn 52, Issue 1-3, 1999, Pages 63-72

  Garzon, Max H ^a   Jonoska, Nataša ^b   Karl, Stephen A ^b  

^a University of Memphis   (United States)

^b UNIVERSITY OF SOUTH FLORIDA   (United States)

Author keywords

Complexity; Computational efficiency; DNA based algorithm; Molecular computation

Indexed keywords

ALGORITHM; ARTICLE; CALCULATION; COMPUTER; DNA DETERMINATION; PHYSICAL CHEMISTRY; QUANTITATIVE GENETICS;

EID: 0032703094     PISSN: 03032647     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0303-2647(99)00033-7     Document Type: Article

References (20)

1. Adleman L.M. Molecular computation of solutions of combinatorial problems. Science. 266:1994;1021-1024.
2. Adleman L.M. On constructing a molecular computer. Lipton R., Baum E. DNA Based Computers. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 27:1996;1-21 American Mathematical Society, Providence, RI.
3. Amos, M., Gibbons, A., Dunne, P., 1997. The complexity and viability of DNA computations. In: Lundh, D., Olson, B., Narayanan, A. (Eds.), Proceedings Biocomputing and Computation (BCEC97), World Scientific, Singapore.
4. Ausubel, F.M., Brent, R., Kingston, R.E., Moore, D.D., Seidman, J.G., Smith, J.A., Struhl, K., Wang-Iverson, P., Bonitz, S.G., 1993. Current Protocols in Molecular Biology. Greene Publishing Associates and Wiley-Interscience, New York, NY.
5. Baum, E., 1998. DNA sequences useful for computation. In: Landweber, L., Baum, E., 1999. DNA Based Computers II, Proceedings of the Second Annual Meeting on DNA Based Computers, DIMACS workshop, Princeton NJ, June 10-12. American Mathematical Society, Providence, RI, pp. 122-127.
6. Deaton, R. Murphy, R.C., Garzon, M., Franceschetti, D.R., Stevens, S.E., Jr., 1999. Good Encodings for DNA-based Solutions to Combinatorial Problems. In: Landweber L., Baum E., 1998. DNA Based Computers II, Proceedings of the Second Annual Meeting on DNA Based Computers, DIMACS workshop, Princeton NJ, June 10-12. American Mathematical Society, Providence RI, pp. 159-171.
7. Deaton R., Garzon M., Murphy R.C., Rose J.A., Franceschetti D.R., Stevens S.E. Jr. On the reliability and efficiency of a DNA-based computation. Phys. Rev. Lett. 80(2):1998;417-420.
8. Garzon, M., Neathery, P., Deaton, R., Murphy, R.C., Franceschetti, D.R., Stevens, S.E., Jr., 1997. A New Metric for DNA Computing. In: Koza J.R., Deb K., Dorigo M., Fogel D.B., Garzon M., Iba H., Riolo R.L., 1997. Proceedings of the 2nd Annual Genetic Programming Conference, Morgan Kaufmann, San Mateo, CA, pp. 472-478.
9. Hames B.D., Higgins S.J., 1985. Nucleic acid hybridization: a practical approach. IRL Press, Washington DC, 244 pp.
10. Hartemink, A.J., Gifford, D.K., 1999. Thermodynamic simulation of deoxyoligonucleotide hybridization of DNA computation. In: Rubin, H., Wood, D. (Eds.), DNA Based Computers III, Proceedings of the Annual Meeting. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, pp. 25-37.
11. Jonoska N., Karl S.A., 1997. Ligation experiments in DNA computations. Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC′97), April 13-16, pp. 261-265.
12. Khodor, J., Gifford, D. (1999). The efficiency of the sequence-specific separation of DNA mixtures for biological computation. In: Rubin, H., Wood, D. (Eds.), DNA Based Computers III, Proceedings of the Annual Meeting. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, pp. 39-46.
13. Koza J.R., Deb K., Dorigo M., Fogel D.B., Garzon M., Iba H., Riolo R.L., 1997. Proceedings of the 2nd Annual Genetic Programming Conference, Morgan Kaufmann, San Mateo, CA.
14. Koza J.R., Deb K., Dorigo M., Fogel D.B., Garzon M., Iba H., Riolo R.L., 1998. Proceedings of the 3rd Annual Genetic Programming Conference, Morgan Kaufmann, San Mateo, CA.
15. Landweber, L., Baum, E., 1999. DNA Based Computers II, Proceedings of the Second Annual Meeting on DNA Based Computers, DIMACS workshop, Princeton NJ, June 10-12. American Mathematical Society, Providence, RI.
16. Lipton R., Baum E. (Eds.), 1996. DNA Based Computers. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 27. American Mathematical Society, Providence, RI.
17. Morimoto N., Arita M., Suyama A., 1999. Solid phase DNA solution to the Hamiltonian Path problem. In: Rubin, H., Wood, D. (Eds.), DNA Based Computers III, Proceedings of the Annual Meeting. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, RI, pp. 193-206.
18. Ouyang Q., Kaplan P.D., Liu S., Libchaber A. DNA solution of the Maximal Clique problem. Science. 278(1997):1997;446-449.
19. Rowes, S., Winfree, E., Burgoyne, R., Chelyapov, N., Goodman, M., Rothemund, P., Adleman, L., 1999. A sticker based architecture for DNA computation. In: Landweber L., Baum E., 1998. DNA Based Computers II, Proceedings of the Second Annual Meeting on DNA Based Computers, DIMACS workshop, Princeton NJ, June 10-12. American Mathematical Society, Providence, RI, pp. 1-30.
20. Wetmur J.G., 1999. Physical chemistry of nucleic acid hybridization. In: Wood D., Lipton R., Seeman N., in press. Proceedings of the Third Annual Meeting on DNA Based Computers, DIMACS Workshop, University of Pennsylvania, June 23-25, 1997, pp. 1-23.