A Programmable Biomolecular Computing Machine with Bacterial Phenotype Output

The main advantage of autonomous biomolecular computing devices over electronic computers is their ability to interact directly with biological systems. No interface is required since all components of molecular computers, including hardware, software, input, and output are molecules that interact in solution along a cascade of programmable chemical events. Here, we demonstrate for the first time that the output of a computation preduced by a molecular finite automaton can be a visible bacterial phenotype. Our 2‐symbol‐2‐state finite automaton utilized linear double‐stranded DNA inputs that were prepared by inserting a string of six base pair symbols into the lacZ gene on the pUC18 plasmid. The computation resulted in a circular plasmid that differed from the original pUC18 by either a 9 base pair (accepting state) or 11 base pair insert (unaccepting state) within the lacZ α region gene. Upon transformation and expression of the resultant plasmids in E. coli, the accepting state was represented by production of functional β‐galactosidase and formation of blue colonies on X‐gal medium. In contrast, the unaccepting state was represented by white colonies due to a shift in the open reading frame of lacZ.

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

[2]  N G Rambidi,et al.  Biomolecular computer: roots and promises. , 1997, Bio Systems.

[3]  Lloyd M. Smith,et al.  DNA computing on surfaces , 2000, Nature.

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

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

[6]  Grzegorz Rozenberg,et al.  Protein output for DNA computing , 2004, Natural Computing.

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

[8]  Friedrich C. Simmel,et al.  A modular DNA signal translator for the controlled release of a protein by an aptamer , 2006, Nucleic acids research.

[9]  Gong Zhang,et al.  Biomolecular autonomous solution of the Hamiltonian path problem via hairpin formation , 2005, Int. J. Bioinform. Res. Appl..

[10]  Naftali Tishby,et al.  Stochastic computing with biomolecular automata , 2004, Proc. Natl. Acad. Sci. USA.

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

[12]  Dmitry M Kolpashchikov,et al.  Boolean control of aptamer binding states. , 2005, Journal of the American Chemical Society.

[13]  E. Shapiro,et al.  An autonomous molecular computer for logical control of gene expression , 2004, Nature.

[14]  J. Sambrook,et al.  Molecular Cloning: A Laboratory Manual , 2001 .

[15]  K Sakamoto,et al.  Molecular computation by DNA hairpin formation. , 2000, Science.

[16]  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.

[17]  Sivan Yogev,et al.  Parallel biomolecular computation on surfaces with advanced finite automata. , 2005, Journal of the American Chemical Society.

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

[19]  Laura F. Landweber,et al.  The past, present and future of molecular computing , 2000, Nature Reviews Molecular Cell Biology.