An Efficient Algorithm for Constructing DNA Boolean Circuit

Computation using biological Deoxyribonucleic acid (DNA) strand is increasingly found to be a viable proposition. A unique generalized efficient algorithm for forming any Boolean circuit strand is proposed in this paper. The implementation of the Boolean circuit using the proposed algorithm is also presented. This Boolean circuit requires only one kind of bio-operation at each level. Further, this paper adopts a uniform representation for logical 0 and 1 for all Boolean circuit. Simulation to validate the efficient algorithm is also presented in this work.

[1]  Piotr Wasiewicz,et al.  Another logical molecular NAND gate system , 1999, Proceedings of the Seventh International Conference on Microelectronics for Neural, Fuzzy and Bio-Inspired Systems.

[2]  Weihong Tan,et al.  DESIGNING A NOVEL MOLECULAR BEACON FOR SURFACE-IMMOBILIZED DNA HYBRIDIZATION STUDIES , 1999 .

[3]  Lloyd M Smith,et al.  Demonstration of a universal surface DNA computer. , 2004, Nucleic acids research.

[4]  M. Ganjtabesh,et al.  DNA algorithm for an unbounded fan-in Boolean circuit. , 2005, Bio Systems.

[5]  A. Condon,et al.  Surface-based DNA computing operations: DESTROY and READOUT. , 1999, Bio Systems.

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

[7]  Jin Xu,et al.  A new DNA computing model for the NAND gate based on induced hairpin formation. , 2004, Bio Systems.

[8]  K. Erk,et al.  Simulating Boolean circuits by finite splicing , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[9]  Wang Wei,et al.  Towards Reliable Simulation of Bounded Fan-in Boolean Circuits using Molecular Beacon , 2006, 2006 6th World Congress on Intelligent Control and Automation.

[10]  Michael Arock,et al.  A Novel Generalized Model for Constructing Reusable and Reliable Logic Gates Using DNA , 2008, 2008 Fourth International Conference on Natural Computation.

[11]  Michael Arock,et al.  A novel generalized design methodology and realization of Boolean operations using DNA , 2009, Biosyst..

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

[13]  Sanjay Tyagi,et al.  Molecular Beacons: Probes that Fluoresce upon Hybridization , 1996, Nature Biotechnology.

[14]  Mitsunori Ogihara,et al.  DNA-Based Self-Propagating Algorithm for Solving Bounded-Fan-In Boolean Circuits , 1999 .

[15]  Erik Winfree,et al.  A Sticker-Based Model for DNA Computation , 1998, J. Comput. Biol..

[16]  M. Ogihara,et al.  Simulating Boolean Circuits on a DNA Computer 1 , .

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