Theoretical and Experimental DNA Computation (Natural ...

References 161
75. M.A. Harrison. Introduction to Switching and Automata Theory. McGraw-Hill,
1965.
76. Juris Hartmanis. On the weight of computations. Bulletin of the European
Association for Theoretical Computer Science, 55:136–138, 1995.
77. Thomas Head. Formal language theory and DNA: an analysis of the generative
capacity of specific recombinant behaviors. Bulletin of Mathematical Biology,
49(6):737–759, 1987.
78. Thomas Head. Splicing schemes and DNA. In G. Rozenberg and A. Salomaa,
editors, Lindenmayer Systems: Impacts on Theoretical Computer Science,
Computer Graphics and Developmental Biology, pages 371–384. Springer, 1992.
79. A. Hjelmfelt, F.W. Schneider, and J. Ross. Pattern recognition in coupled
chemical kinetic systems. Science, pages 335–337, 1993.
80. Allen Hjelmfelt, Edward D. Weinberger, and John Ross. Chemical implementation
of neural networks and Turing machines. Proceedings of the National
Academy of Sciences, 88:10983–10987, 1991.
81. D.A. Jackson, R.H. Symons, and P. Berg. Biochemical method for inserting
new genetic information into DNA of simian virus 40: circular SV40 DNA
molecules containing lambda phage genes and the galactose operon of Escherichia
coli. Proc. Natl. Acad. Sci. USA, 69:2904–2909, 1972.
82. F. Jacob and J. Monod. Genetic regulatory mechanisms in the synthesis of
proteins. Journal of Molecular Biology, 3:318–356, 1961.
83. Joseph JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
84. Natasha Jonoska, Gheorge Păun, and Grzegorz Rozenberg, editors. Aspects of
Molecular Computing: Essays Dedicated to Tom Head on the Occasion of his
70th Birthday. Springer, 2004. Lecture Notes in Computer Science Volume
2950.
85. P.D. Kaplan, Q. Ouyang, D.S. Thaler, and A. Libchaber. Parallel overlap
assembly for the construction of computational DNA libraries. Journal of
Theoretical Biology, 188(3):333–341, 1997.
86. Peter Kaplan, Guillermo Cecchi, and Albert Libchaber. Molecular Computation:
Adleman’s Experiment Repeated. Technical report, NEC Research Institute,
1995.
87. Peter D. Kaplan, Guillermo Cecchi, and Albert Libchaber. DNA based molecular
computation: template-template interactions in PCR. In Landweber and
Baum [94].
88. Lila Kari and Laura F. Landweber. Computational power of gene rearrangement.InErikWinfreeandDavid
K. Gifford, editors, Proceedings 5th DIMACS
Workshop on DNA Based Computers, held at the Massachusetts Institute of
Technology, Cambridge, MA, USA June 14–June 15, 1999, pages 207–216.
American Mathematical Society, 1999.
89. Richard M. Karp. Reducibility among combinatorial problems. In Raymond E.
Miller and James W. Thatcher, editors, Complexity of Computer Computations,
pages 85–103. Plenum Press, 1972.
90. Richard M. Karp, Claire Kenyon, and Orli Waarts. Error-resilient DNA computation.
In 7th ACM-SIAM Symposium on Discrete Algorithms, pages 458–467.
SIAM, 1996.
91. V.M. Khrapchenko. Asymptotic estimation of addition time of a parallel adder.
Prob. Kibernet., 19:107–122, 1967. In Russian, translation in Syst. Theory.
Res., 19, (1970), 105–122.