Theoretical and Experimental DNA Computation (Natural ...

160 References
53. Dónall A. Mac Dónaill. On the scalability of molecular computational solutions
to NP problems. The Journal of Universal Computer Science, 2(2):87–95,
February 1996.
54. Paul E. Dunne. The Complexity of Boolean Networks. Academic Press, 1988.
55. A. Ehrenfeucht, T. Harju, I. Petre, D.M. Prescott, and G. Rozenberg. Computation
in Living Cells: Gene Assembly in Ciliates. Springer, 2004.
56. A. Ehrenfeucht, I. Petre, D.M. Prescott, and G. Rozenberg. Formal systems
for gene assembly in ciliates. Theoretical Computer Science, 292(1):199–219,
2003.
57. M. Elowitz and S. Leibler. A synthetic oscillatory network of transcriptional
regulators. Nature, 403:335–338, January 2000.
58. Dirk Faulhammer, Anthony R. Cukras, Richard J. Lipton, and Laura F.
Landweber. Molecular computation: RNA solutions to chess problems. Proceedings
of the National Academies of Science, 97(4):1385–1389, 2000.
59. Richard P. Feynman. There’s plenty of room at the bottom. In D. Gilbert,
editor, Miniaturization, pages 282–296. Reinhold, 1961.
60. M. Fischer and N.J. Pippenger. Relations among complexity measures. Journal
of the ACM, 26:361–381, 1979.
61. Steven Fortune and James Wyllie. Parallelism in random access machines.
In Conference Record of the Tenth Annual ACM Symposium on Theory of
Computing, pages 114–118, San Diego, California, 1978.
62. T. Gardner, R. Cantor, and J. Collins. Construction of a genetic toggle switch
in Escherichia coli. Nature, 403:339–342, January 2000.
63. Michael R. Garey and David S. Johnson. Computers and Intractability: A
Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New
York, 1979.
64. A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University
Press, 1988.
65. Alan Gibbons, Martyn Amos, and David Hodgson. Models of DNA computation.
In Penczek and Szalas, editors, Mathematical Foundations of Computer
Science (MFCS), volume 1113 of Lecture Notes in Computer Science, pages
18–36. Springer, 1996.
66. Alan Gibbons and Paul Spirakis, editors. Lectures in Parallel Computation.
Cambridge University Press, 1993.
67. A.M. Gibbons. Algorithmic Graph Theory. Cambridge University Press, 1985.
68. D.E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine
Learning. Addison-Wesley, 1989.
69. Larry Gonick and Mark Wheelis. The Cartoon Guide to Genetics. Harper-
Perennial, 1983.
70. John Gribbin. In Search of Schroedinger’s Cat: Quantum Physics and Reality.
Corgi, 1984.
71. Frank Guarnieri, Makiko Fliss, and Carter Bancroft. Making DNA add. Science,
273:220–223, 1996.
72. Z. Guo, R.A Guilfoyle, A.J Thiel, R. Wang, and L.M Smith. Direct fluorescence
analysis of genetic polymorphisms by hybridization with oligonucleotide arrays
on glass supports. Nucl. Acids Res., 22:5456–5465, 1994.
73. Masami Hagiya and Azuma Ohuchi, editors. Proceedings of the 8th International
Workshop on DNA Based Computers. Springer, 2002. LNCS 2568.
74. Andrew Hamilton. Brains that click. Popular Mechanics, 91(3):162–
167,256,258, March 1949.