Solving the Set-Splitting Problem in Sticker-Based Model and the Adleman-Lipton Model

Adleman wrote the first paper in which it was demonstrated that DNA (DeoxyriboNucleic Acid) strands could be applied for dealing with solutions to an instance of the NP complete Hamiltonian path problem (HPP). Lipton wrote the second paper in which it was shown that the Adleman teclmiques could also be used to solving the NP complete satisfiability (SAT) problem (the first NP-complete problem). Adleman and his co authors proposed sticker for enhancing the Adleman Lipton model. In the paper, it is proved how to apply sticker in the sticker based model for constructing solution space of DNA for the set splitting problem and how to apply DNA operations in the Adleman Lipton model to solve that problem from solution space of sticker.

[1]  Mario J. Pérez-Jiménez,et al.  Solving Knapsack Problems in a Sticker Based Model , 2001, DNA.

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

[3]  Gheorghe Paun,et al.  DNA Computing: New Computing Paradigms , 1998 .

[4]  L F Landweber,et al.  Chess games: a model for RNA based computation. , 1999, Bio Systems.

[5]  Leonard M. Adleman,et al.  On constructing a molecular computer , 1995, DNA Based Computers.

[6]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

[8]  Richard J. Lipton,et al.  On the Computational Power of DNA , 1996, Discret. Appl. Math..

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

[10]  Masanori Arita,et al.  Solid phase DNA solution to the Hamiltonian path problem , 1997, DNA Based Computers.

[11]  Leonard M. Adleman,et al.  Solution of a Satisfiability Problem on a Gel-Based DNA Computer , 2000, DNA Computing.

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

[13]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[14]  Byoung-Tak Zhang,et al.  Solving traveling salesman problems using molecular programming , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[15]  Kalim U. Mir.  A restricted genetic alphabet for DNA computing , 1996, DNA Based Computers.

[16]  R. Sinden.  DNA Structure and Function , 1994 .

[17]  Bin Fu,et al.  Volume bounded molecular computation , 1997 .