论文信息 - A DNA solution of SAT problem by a modified sticker model. - 字舞流文

A DNA solution of SAT problem by a modified sticker model.

Chang-Biau Yang | Chang-Biau Yang | Chia-Ning Yang | Chia-Ning Yang

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

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

[3] F Guarnieri,et al. Maya Blue Paint: An Ancient Nanostructured Material , 1996, Science.

[4] Richard J. Lipton,et al. DNA Based Computers , 1996 .

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

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

[7] Erik Winfree,et al. DNA Based Computers V , 2000 .

[8] Shi V. Liu. Debating controversies can enhance creativity , 2000, Nature.

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

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

[11] L F Landweber,et al. Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

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

[13] David I. Lewin,et al. DNA computing , 2002, Comput. Sci. Eng..

[14] Susan D. Gillmor,et al. Computation with DNA on surfaces , 2002 .

[15] Tsvi Tlusty,et al. Protein–DNA computation by stochastic assembly cascade , 2002, Proceedings of the National Academy of Sciences of the United States of America.