Molecular Computing Machines

Biopolymers such as nucleic acids and proteins encode biological data and may be viewed as strings of chemical letters. While electronic computers manipulate strings of 0’s and 1’s encoded in electric signals, biologically encoded data might, in principle, be manipulated by biochemical means. During the last decade, several approaches to compute with biomolecules were developed, and the field has become known as biomolecular or DNA computing. The approaches varied widely with respect to the model of computation they employed, the problems they attempted to solve, and the degree of human intervention. One approach focused on the application of the Turing machine model and, more generally, string-processing automata to biomolecular information processing. Its goal is to construct computers made of biomolecules that are capable of autonomous conversion of an input dataencoding molecule to an output molecule according to a set of rules defined by a molecular program. Here we survey the field of biomolecular computing machines and discuss possible future directions.

[1]  Ehud Shapiro,et al.  DNA molecule provides a computing machine with both data and fuel , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[2]  L. Karl.  DNA computing: Arrival of biological mathematics , 1997 .

[3]  M. Sahani,et al.  Algorithmic Self-Assembly of DNA , 2006 .

[4]  E. Shapiro,et al.  Programmable and autonomous computing machine made of biomolecules , 2001, Nature.

[5]  Ehud Shapiro,et al.  Algorithmic Program Debugging , 1983 .

[6]  J. Reif,et al.  A two-state DNA lattice switched by DNA nanoactuator. , 2003, Angewandte Chemie.

[7]  Krzysztof R. Apt,et al.  Logics and Models of Concurrent Systems , 1989, NATO ASI Series.

[8]  Charles H. Bennett,et al.  The thermodynamics of computation—a review , 1982 .

[9]  M. Hagiya,et al.  State transitions by molecules. , 1999, Bio Systems.

[10]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[11]  J. Davies,et al.  Molecular Biology of the Cell , 1983, Bristol Medico-Chirurgical Journal.

[12]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[13]  Amir Pnueli,et al.  On the Development of Reactive Systems , 1989, Logics and Models of Concurrent Systems.

[14]  Warren D. Smith.  DNA computers in vitro and vivo , 1995, DNA Based Computers.

[15]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[16]  Hao Wang,et al.  Proving theorems by pattern recognition I , 1960, Commun. ACM.

[17]  Jules Moreau,et al.  Molecular Computation by DNA Hairpin Formation , 2000 .

[18]  Erik Winfree,et al.  On the computational power of DNA annealing and ligation , 1995, DNA Based Computers.

[19]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[20]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[21]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[22]  Hao Wang.  Proving theorems by pattern recognition — II , 1961 .

[23]  R J Lipton,et al.  DNA solution of hard computational problems. , 1995, Science.

[24]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[25]  Paul W. K. Rothemund,et al.  A DNA and restriction enzyme implementation of Turing machines , 1995, DNA Based Computers.

[26]  P D Kaplan,et al.  DNA solution of the maximal clique problem. , 1997, Science.

[27]  Max H. Garzon,et al.  In Vitro Implementation of Finite-State Machines , 1997, Workshop on Implementing Automata.