Sticker Model for Maximum Clique Problem and Maximum Independent Set: Sticker Model for Maximum Clique Problem and Maximum Independent Set

[1]  Karl-Heinz Zimmermann,et al.  Efficient DNA sticker algorithms for NP-complete graph problems , 2002 .

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

[3]  H Wu.  An improved surface-based method for DNA computation. , 2001, Bio Systems.

[4]  G Rozenberg,et al.  Computing with DNA by operating on plasmids. , 2000, Bio Systems.

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

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

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

[8]  A. Condon,et al.  Progress toward demonstration of a surface based DNA computation: a one word approach to solve a model satisfiability problem. , 1999, Bio Systems.

[9]  Erik Winfree,et al.  On applying molecular computation to the data encryption standard , 1999, DNA Based Computers.

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

[11]  Qinghua Liu,et al.  A surface-based approach to DNA computation , 1996, DNA Based Computers.

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

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

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

[15]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .