Constructing molecular parallel subtractor and modular with basic bio-logic operations in the Adleman-Lipton model

Adleman proposed a bio-molecular solution to The NP-complete Hamiltonian Path Problem (HPP). No longer is the non solution for any NP problem. Lipton also demonstrated that Adleman's techniques could be used to solve the Satisfiability (SAT) problem. In this paper, we demonstrate how the DNA operations presented by Adleman and Lipton can be used to construct biomolecular parallel subtractor and modular with basic logic operations in the Adleman-Lipton model.

[1]  Michael Shan-Hui Ho.  Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem. , 2005, Bio Systems.

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

[3]  Martyn Amos,et al.  Theoretical and Experimental DNA Computation , 1999, Bull. EATCS.

[4]  Jens Kurreck,et al.  Nucleic acids chemistry and biology. , 2003, Angewandte Chemie.

[5]  S. Grimwade.  Recombinant DNA , 1977, Nature.

[6]  Grace Jordison.  Molecular Biology of the Gene , 1965, The Yale Journal of Biology and Medicine.

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

[8]  Junzo Watada,et al.  DNA Computing and Its Applications , 2008, 2008 Eighth International Conference on Intelligent Systems Design and Applications.

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