A New DNA Implementation of Finite State Machines

Two new models for implementing finite state machines with DNA computing are presented. The operations used in both models are simple and easy to implement. Operations include immobilization of DNA strands onto paramagnetic beads, DNA hybridization, DNA ligation and restriction enzyme cleavage. Use of paramagnetic beads greatly reduces performance time and demonstrates DNA chip compatibility of the models. In one of the models, the length of DNA strands created during the intermediate operations are independent of the length of the input string. Optical extraction in both models detects the final state.

[1]  Ronald W. Davis,et al.  Multiplexed genotyping with sequence-tagged molecular inversion probes , 2003, Nature Biotechnology.

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

[3]  Jack Parker.  Computing with DNA , 2003, EMBO reports.

[4]  Byoung-Tak Zhang,et al.  NACST/Seq: A Sequence Design System with Multiobjective Optimization , 2002, DNA.

[5]  Clifford R. Johnson,et al.  Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.

[6]  Masahito Yamamoto,et al.  Developing Support System for Sequence Design in DNA Computing , 2001, DNA.

[7]  Masahito Yamamoto,et al.  Solutions of Shortest Path Problems by Concentration Control , 2001, DNA.

[8]  U Landegren,et al.  PCR-generated padlock probes detect single nucleotide variation in genomic DNA. , 2000, Nucleic acids research.

[9]  Max H. Garzon,et al.  Reliability and Efficiency of a DNA-Based Computation , 1998 .

[10]  M. Ogihara,et al.  Simulating Boolean Circuits on a DNA Computer , 1997, RECOMB '97.

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

[12]  U Landegren,et al.  Padlock probes: circularizing oligonucleotides for localized DNA detection. , 1994, Science.

[13]  A Hjelmfelt,et al.  Chemical implementation of neural networks and Turing machines. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

[14]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[15]  Marzuki Khalid,et al.  Direct-Proportional Length-Based DNA Computing for Shortest Path Problem , 2004, Int. J. Comput. Sci. Appl..

[16]  Ronald W Davis,et al.  Multiplex Pyrosequencing. , 2002, Nucleic acids research.

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

[18]  Max H. Garzon,et al.  DNA implementation of nondeterminism , 1997, DNA Based Computers.

[19]  David S. Johnson,et al.  Dimacs series in discrete mathematics and theoretical computer science , 1996 .

[20]  Richard J. Lipton,et al.  Speeding up computations via molecular biology , 1995, DNA Based Computers.

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

[22]  F. Barany.  Genetic disease detection and DNA amplification using cloned thermostable ligase. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

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