Stochastic computing with biomolecular automata

Stochastic computing has a broad range of applications, yet electronic computers realize its basic step, stochastic choice between alternative computation paths, in a cumbersome way. Biomolecular computers use a different computational paradigm and hence afford novel designs. We constructed a stochastic molecular automaton in which stochastic choice is realized by means of competition between alternative biochemical pathways, and choice probabilities are programmed by the relative molar concentrations of the software molecules coding for the alternatives. Programmable and autonomous stochastic molecular automata have been shown to perform direct analysis of disease-related molecular indicators in vitro and may have the potential to provide in situ medical diagnosis and cure.

[1]  Roberto Segala,et al.  A Compositional Trace-Based Semantics for Probabilistic Automata , 1995, CONCUR.

[2]  A. Arkin,et al.  Stochastic mechanisms in gene expression. , 1997, Proceedings of the National Academy of Sciences of the United States of America.

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

[4]  Tsvi Tlusty,et al.  Protein–DNA computation by stochastic assembly cascade , 2002, Proceedings of the National Academy of Sciences of the United States of America.

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

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

[7]  D K Gifford,et al.  Design and implementation of computational systems based on programmed mutagenesis. , 1999, Bio Systems.

[8]  Golan Yona,et al.  Variations on probabilistic suffix trees: statistical modeling and prediction of protein families , 2001, Bioinform..

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

[10]  J. Gentle.  Random number generation and Monte Carlo methods , 1998 .

[11]  E. Shapiro,et al.  Cellular abstractions: Cells as computation , 2002, Nature.

[12]  Pekka Orponen,et al.  On the Effect of Analog Noise in Discrete-Time Analog Computations , 1996, Neural Computation.

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

[14]  Karol Putyera,et al.  Dekker Encyclopedia of Nanoscience and Nanotechnology , 2004 .

[15]  Charles H. Bennett,et al.  Dissipation-error tradeoff in proofreading. , 1979, Bio Systems.

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

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

[18]  김삼묘,et al.  “Bioinformatics” 특집을 내면서 , 2000 .

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

[20]  Darko Stefanovic,et al.  A deoxyribozyme-based molecular automaton , 2003, Nature Biotechnology.

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

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

[23]  Corrado Priami,et al.  Application of a stochastic name-passing calculus to representation and simulation of molecular processes , 2001, Inf. Process. Lett..

[24]  Ricard V. Solé,et al.  Characterizing turbulence in globally coupled maps with stochastic finite automata , 2000 .

[25]  Gert Cauwenberghs,et al.  Delta-sigma cellular automata for analog VLSI random vector generation , 1999 .

[26]  Sean R. Eddy,et al.  Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .

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

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