Theoretical and Experimental DNA Computation (Natural ...

158 References
14. Martyn Amos, Steve Wilson, David A. Hodgson, Gerald Owenson, and Alan
Gibbons. Practical implementation of DNA computations. In C.S. Calude,
J. Casti, and M.J. Dinneen, editors, Unconventional Models of Computation,
Discrete Mathematics and Theoretical Computer Science, pages 1–18. Springer,
Singapore, 1998.
15. K. Appel and W. Haken. Every planar map is four colorable. American
Mathematical Society Bulletin, 82(5):711–712, 1976.
16. K. Appel and W. Haken. Every Planar Map is Four Colorable, volume98of
Contemporary Mathematics. American Mathematical Society, 1989.
17. A. Arkin and J. Ross. Computational functions in biochemical reaction networks.
Biophysical Journal, 67:560–578, 1994.
18. Frederick M. Ausubel, Roger Brent, Robert E. Kingston, David D. Moore,
J.G. Seidman, John A. Smith, and Kevin Struhl, editors. Short Protocols in
Molecular Biology. Wiley, 4th edition, 1999.
19. Eric Bach, Anne Condon, Elton Glaser, and Celena Tanguay. DNA models and
algorithms for NP-Complete problems. In Proceedings of the 11th Conference
on Computational Complexity, pages 290–299. IEEE Computer Society Press,
1996.
20. Jean-Pierre Banâtre and Daniel Le Métayer. The GAMMA model and its
discipline of programming. Science of Computer Programming, 15:55–77, 1990.
21. Jean-Pierre Banâtre and Daniel Le Métayer. Programming by multiset transformation.
Communications of the ACM, 36(1):98–111, 1993.
22. K.E. Batcher. Sorting networks and their applications. In Proc. American
Federation of Information Processing Societies 1968 Spring Joint Computer
Conference, volume 32, pages 307–314, Washington, D.C., 1968. Thompson
Book Co.
23. Eric B. Baum. DNA sequences useful for computation. In Landweber and
Baum [94].
24. Eric B. Baum and Dan Boneh. Running dynamic programming algorithms on
a DNA computer. In Landweber and Baum [94].
25. Eric B. Baum and Richard J. Lipton, editors. DNA Based Computers, volume
27 of DIMACS: Series in Discrete Mathematics and Theoretical Computer
Science. ISSN: 1052-1798. American Mathematical Society, 1996.
26. P. Beame, S. Cook, and H. Hoover. Log depth circuits for division and related
problems. SIAM Journal of Computing, 15(4):994–1003, 1986.
27. Yaakov Benenson, Rivka Adam, Tamar Paz-Livneh, and Ehud Shapiro. DNA
molecule provides a computing machine with both data and fuel. Proceedings
of the National Academies of Science, 100(5):2191–2196, 2003.
28. Yaakov Benenson, Tamar Paz-Elizur, Rivka Adar, Ehud Keinan, Zvi Livneh,
and Ehud Shapiro. Programmable and autonomous computing machine made
of biomolecules. Nature, 414:430–434, 2001.
29. C.H. Bennett. The thermodynamics of computation – a review. International
Journal of Theoretical Physics, 21:905–940, 1982.
30. Gérard Berry and Gérard Boudol. The chemical abstract machine. Theoretical
Computer Science, 96:217–248, 1992.
31. New England Biolabs. Catalog, 1996.
32. Dan Boneh, Christopher Dunworth, Richard J. Lipton, and Ji˘rí Sgall. Making
DNA computers error resistant. In Landweber and Baum [94].