Biomolecular computing: Is it ready to take off?

Biotechnology Journal

Volumn 2, Issue 1, 2007, Pages 91-101

  Fu, Pengcheng ^a  

^a UNIVERSITY OF HAWAII   (United States)

Author keywords

Biocomputing; DNA strand; Massive parallelism; Self assembling; Steganography

Indexed keywords

DNA;

ALGORITHM; BIOLOGY; COMPUTER; DNA RNA HYBRIDIZATION; DNA STRAND; ENGINEERING; GENE AMPLIFICATION; GENETIC ENGINEERING; MATHEMATICAL COMPUTING; MOLECULAR DYNAMICS; POLYMERASE CHAIN REACTION; PRIORITY JOURNAL; PROBLEM SOLVING; REVIEW; BIOTECHNOLOGY; CHEMISTRY; METHODOLOGY; MOLECULAR COMPUTER;

BIOTECHNOLOGY; COMPUTATIONAL BIOLOGY; COMPUTERS, MOLECULAR; DNA;

EID: 33847030821     PISSN: 18606768     EISSN: None     Source Type: Journal    
DOI: 10.1002/biot.200600134     Document Type: Review

References (86)

1. Feymnan, R. P., There's plenty of room at the bottom. In: Gilbert, D. H. (Ed.), Minaturization, Reinhold Publishing Corporation, New York 1961, pp. 282-296.
2. Head, T., Formal language theory and DNA: an analysis of the generative capacity of special recombinant behaviors. Bull Math. Biol. 1987, 49, 737-759.
3. Head, T., Splicing systems and DNA, in: Handbook ofFormal Languages. Springer-Verlag, Berlin 1992, pp 371-383.
4. Adleman, L., Molecular computation of solutions to combinatorial problem. Science 1994, 266, 1021-1024.
5. Rubin, F., A Search Procedure for Hamilton Paths and Circuits. J. ACM 1974, 21, 5404-5411.
6. Garey, M. R., Johnson, D. S., Computers and Intractability: A Guide to the Theory ofNP-Completeness, W. H. Freeman, New York 1979
7. Ouryang, Q., Kaplan, P. D., Liu, S., Libchaben A., DNA Solution of the maximal clique problem. Science 1997, 278, 446-449.
8. Braich, R. S, Chelyapof, N., Johnson, C., Rothemund, P W. K, Adleman, L. M., Solution of a 20-variable 3-SAT problem on a DNA computer. Science 2002, 296, 499-502.
9. Garzon, M. H., Deaton, R. J, Biomolecular computing and programming. IEEE Trans. Evolut. Comput. 1999, 3, 236-250.
10. Reif, J. H., Computing: Successes and Challenges. Science 2002, 296, 478-479.
11. Kashiwamura, S., Yamamoto, M., Kameda, A., Shiba, T., Ohuchi, A., Potential for enlarging DNA memory: the validity of experimental operations of scaled-up nested primer molecular memory. Biosystems 2005, 80, 99-112.
12. Cox, J. P. L., Long-term data storage in DNA. Trends Biotechnol. 2001, 19, 247-250.
13. Faulhammer, D., Lipton R. J., Landweber, L. F., Counting DNA: estimating the complexity of a test tube of DNA. Biosystems 1999, 52, 193-196.
14. Chen, J., Wood, D, A new DNA separation technique with low error rate, in: Third DIMACS Workshop on DNA Based Computers, June 1997, Philadelphia, pp. 43-58.
15. Williams, R., Wood, D., Exascale computer algebra problems interconnect with molecular reactions and complexity theory, in: Second Annual Meeting on DNA Based Computers, June 1996, Princeton, pp. 260-268.
16. Wood, D., Applying error correcting codes to DNA computing, in: Fourth International Meeting on DNA Based Computers, June 1998 Philadelphia, pp. 109-110.
17. Hartemink, A., Gifford, D., Khodor, J. Automated constraint-based nucleotide sequence selection for DNA computation, in: Fourth International Meeting on DNA Based Computers, June 1998, Philadelphia, pp. 287-297.
18. Khodor, J., Gifford, D., Design and implementation of computational systems based on programmed mutagenesis, in: Fourth International Meeting on DNA Based Computers, June 1998, Philadelphia, pp. 101-108.
19. Deaton, R., Garzon, M., Murphy, R.C., Rose, J.A. et al., Reliability and Efficiency of a DNA-Based Computation. Phys. Rev. Lett. 1998, 80, 417-420.
20. Cai, W., Condon, A. E., Corn, R. M,, Glaser, E. et al., The power of surface-based DNA computation, in RECOMB'97. Proceedings of the First Annual International Conference on Computational Molecular Biology, New York, 1997, pp 67-74.
21. Frutos, A. G., Thiel, A. J, Condon, A. E., Smith, L. M., Corn, R. M., DNA computing at surfaces: 4 base mismatch word design, in: Third DIMACS Workshop on DNA Based Computers, June 1997, Philadelphia. pp. 238-239.
22. Garzon, M., Deaton, R., Neathery, P., Murphy, R C. et al., On the encoding problem for DNA computing, in: Third DIMACS Workshop on DNA Based Computers, June 1997, Philadelphia, pp. 230-237.
23. Wang, L., Liu, O., Frutos, A., Gillmor, S. et al., Surface-based DNA computing operations: Destroy and readout, in: Fourth International Meeting on DNA Based Computers, June 1998, Philadelphia, pp. 247-248.
24. Roweis, S., Winfree, E., Burgoyne, R., Nickolas, V. et al., A sticker based model for DNA computation, in: Proceedings of 2nd Annual DIMACS Workshop on DNA Based Computers (Discrete Mathematics and Theoretical Computer Science), June 10-12 1996, Princeton.
25. Roweis, S., Winfree, E., Burgoyne, R., Nickolas, V. at al., A sticker based model for DNA. J. Comput. Biol. 1998, 5, 615-629.
26. Amos, M., Dunne, P. DNA simulation of Boolean circuit, Department of Computer Science, University of Warwick, UK, 1998.
27. Hagiya, M., Arita, M., Towards parallel evaluation and learning of Boolean μ-formulas with molecules, in: Third DIMACS Workshop on DNA Based Computers, June 1997, Philadelphia, pp. 105-114.
28. Ogihara, M., Ray, A., Simulating Boolean circuits on a DNA computer. in: First Annual Conference on Computational Molecular Biology. New York 1997, pp. 326-331.
29. Ogihara, M, Ray, A., DNA-based self-propagating algorithm for solving bounded-fan-in Boolean circuits, in 3rd Conference on Genetic Proqramming, Philadelphia, 1998, 725-730.
30. Ogihara, M., Ray, A., Circuit evaluation: Thoughts on a killer application in DNA computing, in Computing with Bio-Molecules. Theory and Experiments, Springer-Verlag, Heidelberg 1998.
31. Ogihara, M., Relating the minimum model for DNA computation and Boolean circuits, in: Proceedings of the Genetic and Evolutionary Computation Conference, 1999, San Francisco, pp. 1817-1821.
32. Ogihara, M., Ray, A., Executing parallel logical operations with DNA, in: Proceedings of the IEEE Congress on Evolutionary Computation, 1999, Washington, pp. 972-979.
33. Chang, W.-L., He, M. S. H., Guo, M., Molecular solutions for the subset-sum problem on DNA-based supercomputing. Biosystems 2004, 73, 117-130.
34. Amos, M., Paun, G., Rozenberg, G., Salomaa, A., Topics in the theory of DNA computing. Theor. Comput. Sci. 2002, 287, 3-38.
35. Wang, S., Yang, A., DNA solution of integer linear programming. Appl. Math. Comput. 2005, 170, 626-632.
36. Guarnieri, F., M. Fliss, C. Bancroft, Making DNA add. Science 1996, 273, 220-223.
37. Lipton, R.J., DNA solution of hard computational problems. Science 1995, 268, 542-545.
38. Ho, M.S.-H., Fast Parallel Molecular Algorithms for DNA-Based Computation: Factoring Integers. IEEE Transactions on Nanobioscience, 2005, Biosystems 2005, 4, 149-163.
39. Yan, H, Park, S. H., Finkelstein, G., Reif, J. H. et al., DNA-templated self-assembly of protein arrays and highly conductive nanowires. Science 2003, 301, 1882-1884.
40. Wang, H., Proving theorems by pattern recognition. Bell System Tech. J. 1961, 40, 1-42.
41. Turing, A., On computable numbers, with an application to the entscheidungsproblem, in: Proceedings of the London Mathematical Society, Series 2, Vol. 42 (1936). Reprinted, in: Davis, M. (Ed.), The Undecidable, Raven Press, Hewlett 1965.
42. Winfree, E., Eng, T., Rozenberg, G., String Tile Models for DNA Computing by Self-Assembly. Lect. Notes Comput. Sci. 2001, 2054, 63-88.
43. Winfree, E., Algorithmic Self-Assembly of DNA, Ph.D. Dissertation, California Institute of Technology, Pasadena CA, 1998.
44. Rothemund, P W. K., Using lateral capillary forces to compute by self-assembly. Proc. Natl. Acad. Sci. USA 2000, 97, 984-989.
45. Brenneman, A., Condon, A., Strand design for biomolecular computation. Theor. Comput. Sci. 2002, 287, 39-58.
46. Seeman, N. C., DNA Nanotechnology: Novel DNA Constructions. Annu. Rev. Biophy. Biomol. Struct. 1998, 27, 225-248.
47. Rozenberg, G., Spaink, H., DNA computing by blocking. Theor. Comput. Sci. 2003, 292, 653-665.
48. Winfree, E., Liu, F, Wenzler, L. A., Seeman, N. C., Design and self-assembly of 2D DNA crystals. Nature 1998, 394, 539-544.
49. Mao, C., Sun, W, Seeman, N. C., Designed two-dimensional DNA Holliday jumction arrays visualized by atomic force microscopy. J. Am. Chem. Soc. 1999, 121, 5437-5443.
50. Mao, C., LaBean, T. H., Reif, J. H., Seeman, N. C., Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 2000, 407, 493-496.
51. Seeman, N. C., De novo design of sequences for nucleic acid structural engineering. J. Biomol. Struct. Dyn. 1990, 8, 573-581.
52. Feldkamp, U., W. Banzhaf, W., Rauhe, H., A DNA Sequence Compiler, in; Condon, A., Rozenberg, G. (Eds.), Preliminary Proceedings of the Sixth DIMACS Workshop on DNA-Computing, June 13th-17th 2000, Leiden, p. 253.
53. McCaskill, J. S., The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers 1990, 29, 1105-1109.
54. Committee on Frontiers at the Interface of Computing and Biology, National Research Council, Biological inspiration for computing, in: Wooley, J. C., Lin, H. S. (Eds.), Catalyzing Inquiry at the Interface of Computing and Biology, Chapter 8. The National Academies Press, Washington DC, 2005.
55. Deaton, R. J., Chen, J., Bi, H., Rose, J. A., A software tool for generating non-crosshybridizing libraries of DNA oligonucleotides. Lect. Notes Comput. Sci. 2003, 2568, 252-261.
56. Feldkamp, U., Rauhe, H., Banzhaf, W., Software tools for DNA sequence design. Genet. Program. Evolvable Machines 2003, 4, 153-171.
57. Hartemink, A. J., Gifford, D. K., Khodor, J., Automated constraint-based nucleotide sequence selection for DNA computation, in: Proceedings of the Fourth Annual DIMACS Workshop on DNA Based Computers, University of Pennysylvania, June 15-19,1998, Philadelphia.
58. Ruben, A. J., Landweber, L. F., The past, present, and future of molecular computing. Nat. Rev Mol. Cell Biol. 2000, 1, 69-72.
59. Faulhammer, D., Cukras, A. R., Lipton, R.J., Landweber, L. F., Molecular computation: RNA solutions to chess problems. Proc. Natl. Acad. Sci. USA 2000, 97, 1385-1389.
60. Cukras, A.R., Faulhammer, D., Lipton, R. J., Landweber, L. F., Chess games: a model for RNA based computation. Biosystems 1999, 52, 35-45.
61. Wang, L., Liu, Q., Corn, R. M., Condon, A. E., Smith, L. M., Multiple word DNA computing on surfaces. J. Am. Chem. Soc. 2000, 122, 7435-7440.
62. Manca, V, Martin-Vide, C., Paun, G., New computing paradigms suggested by DNA computing: computing by carving. Biosystems 1999, 52, 47-54.
63. Head, T., Rozenberg, G., Bladergroen, R. S., Breek, C. K. D. et al., Computing with DNA by operating on plasmids. Biosystems 2000, 57, 87-93.
64. Clelland, C. T., Risca, V., Bancroft, C., Hiding messages in DNA microdots. Nature 1999, 399, 533-534.
65. Leier, A., Richter, C., Banzhaf, W., Rauhe, H., Cryptography with DNA binary strands, Biosystems 2000, 57, 13-22.
66. Gehani, A., LaBean, T. H., Reif, J. H., DNA-based cryptography, in: Proceedings of 5th Annual DIMACS Meeting on DNA Based Computers (DNA 5), MIT, Cambridge June, 1999.
67. Beigel, R., Fu, B., Molecular approximation algorithm for NP optimization problems, in: Third DIMACS Workshop on DNA Based Computers, June 1997, Philadelphia, pp. 93-104.
68. Bach, E., Condon, A., Glaser, E., Tanguay, C., DNA Models and Algorithms for NP-completeproblems. IEEE Computer Society Press, 1996, pp. 290-299.
69. Shi, X. Li, X., Zhang, Z., Xu, J. et al., Improve capability of DNA automation: DNA automation with three internal states and tape head move in two directions. Lect. Notes Comput. Sci. 2005, 3645, 1101-1013.
70. Reif, J., Local parallel biomolecular computation, in: Third DIMACS Workshop on DNA Based Computers, June 1997, Philadelphia, pp. 243-264.
71. Takinoue, M., Suyama, A., Molecular reactions for a molecular memory based on hairpin DNA. Chem-Bio. Informatics J. 2004, 4, 93-100.
72. Edwards, J. S., Ramakrishna, R., Schilling, C. H., Palsson, B. O., Metabolic flux balance analysis, in: Lee, S. Y., Papoutsakis, E.. T. (Eds.), Metabolic Engineering. Marcel Deker, New York 1999.
73. Edwards, J. S., Palsson, B.O., The Escherichia coli MG1655 in silico metabolic genotype: Its definition, characteristics, and capabilities. Proc. Natl. Acad. Sci. USA 2000, 97, 5528-5533.
74. Reed, J. L., Vo, T. D., Schilling, C. H., Palsson, B. O., An expanded genome scale model of Escherichia coli K-12 (iJR904 GSM/GPR). Genome Biol. 2003, 4, R54.
75. Edwards, J. S., Palsson, B. O., Systems properties of the Haemophilus influenzae Rd metabolic genotype. J. Biol. Chem. 1999, 274, 17410-17416.
76. Schilling, C. H., Covert, M. W., Famili, I., Church, G. M., Edwards, J. S., Palsson, B O., Genome-scale metabolic model of Helicobacter pylori 26695. J. Bacteriol. 2000, 184, 4582-4593.
77. Forster, J., Famili, I., Fu, P. C., Palsson, B. O., Nielsen, J., Genome-scale reconstruction of the Saccharomyces cerevisiae metabolic network. Genome Res. 2003, 13, 244-253.
78. Becker, S. A., Palsson, B. O. Genome-scale reconstruction of the metabolic network in Staphylococcus aureus N315: an initial draft to the two-dimensional annotation. BMC Microbiol. 2005. 5, 8.
79. Edwards, J. S., Covert, M., Palsson, B. O., Metabolic modelling of microbes: the flux-balance approach. Environ. Microbiol. 2002, 4, 133-140.
80. Varma, A., Palsson, B. O., Metabolic flux balancing: basic concepts, scientific and practical use. Bio/Technology 1994, 12, 994-998.
81. Edwards, J. S., Ibarra, R. U., Palsson, B. O., In silico predictions of Escherichia coli metabolic capabilities are consistent with experimental data. Nat. Brotechnol. 2001, 19, 125-130.
82. Forster, J., Famill, I., Palsson, B. O., Nielsen J., Large-scale evalliation of in silico gene knockouts in Saccharomyces cerevisiae. Omics 2003, 7, 193-202.
83. Covert, M. W., Palsson, B. O., Transcriptional regulation in constraints-based metabolic models of Escherichia coli. J. Biol. Chem. 2002, 277, 28058-28064.
84. Reed, J. L., Palsson, B. O., Thirteen years of building constraint-based in silico models of Escherichia coli. J. Bacteriol. 2003, 185, 2692-2699.
85. Ibarra, R. U., Edwards, J. S., Palsson, B. O., Escherichia coli K-12 undergoes adaptive evolution to achieve in silico predicted optimal growth. Nature 2002, 420, 186-189.
86. Sakamoto, K., Gouzu H., Komiya, K., Kiga, D. et al., Molecular Computation by DNA Hairpin Formation. Science 2000, 288, 1223-1226.