Molecular fast solution for set-basis problem on sticker-based model
暂无分享,去创建一个
In the paper, it is demonstrated how to apply sticker in the sticker-based model for constructing solution space of DNA for the set-basis problem and how to apply DNA operations in the Adleman-Lipton model to solve that problem from solution space of sticker.
[1] L F Landweber,et al. Chess games: a model for RNA based computation. , 1999, Bio Systems.
[2] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[3] Leonard M. Adleman,et al. Solution of a Satisfiability Problem on a Gel-Based DNA Computer , 2000, DNA Computing.
[4] Erik Winfree,et al. A sticker based model for DNA computation , 1996, DNA Based Computers.