Sticker DNA computer model —Part I: Theory
暂无分享,去创建一个
Xiaopeng Wei | Yafei Dong | Jin Xu | Jin Xu | Yafei Dong | Xiaopeng Wei
[1] 榊原 康文,et al. G. Paun, G. Rozenberg and A. Salomaa : "DNA Computing-New Computing Paradigms", Springer-Verlag (1998) , 2000 .
[2] Gheorghe Paun,et al. DNA computing, sticker systems, and universality , 1998, Acta Informatica.
[3] P D Kaplan,et al. DNA solution of the maximal clique problem. , 1997, Science.
[4] Jin Xu,et al. A DNA Algorithm for the Graph Coloring Problem , 2002, J. Chem. Inf. Comput. Sci..
[5] Linqiang Pan,et al. A surface-based DNA algorithm for the minimal vertex cover problem , 2003 .
[6] L M Adleman,et al. Molecular computation of solutions to combinatorial problems. , 1994, Science.
[7] Gheorghe Paun,et al. DNA Computing: New Computing Paradigms , 1998 .
[8] T. Head. Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. , 1987, Bulletin of mathematical biology.
[9] Gao Lin. DNA Algorithm to the Directed Shortest Hamilton Path Problem , 2002 .
[10] Jin Xu,et al. DNA Solution of a Graph Coloring Problem , 2002, J. Chem. Inf. Comput. Sci..
[11] L. Karl. DNA computing: Arrival of biological mathematics , 1997 .
[12] Xu Jin. DNA Computer Principle, Advances and Difficulties (I):Biological Computing System and Its Applications to Graph Theory , 2003 .
[13] Clifford R. Johnson,et al. Solution of a 20-Variable 3-SAT Problem on a DNA Computer , 2002, Science.
[14] Karl-Heinz Zimmermann,et al. Efficient DNA sticker algorithms for NP-complete graph problems , 2002 .
[15] Grzegorz Rozenberg,et al. Sticker Systems , 1998, Theor. Comput. Sci..
[16] Jin Xu,et al. A Chinese Postman Problem Based on DNA Computing , 2002, J. Chem. Inf. Comput. Sci..
[17] G Rozenberg,et al. Computing with DNA by operating on plasmids. , 2000, Bio Systems.