Author:
Hsieh Sun-Yuan,Huang Chao-Wen,Chou Hsin-Hung
Subject
Applied Mathematics,Computational Mathematics
Reference24 articles.
1. Molecular computation of solutions to combinatorial problems;Adleman;Science,1994
2. R.S. Braich, C. Johnson, P.W.K. Rothemund, D. Hwang, N. Chelyapov, M. Leonard, L.M. Adleman, Solution of a satisfiability problem on a gel-based DNA computer, in: Proceedings of the Sixth International Conference on DNA Computation (DNA 2000), Lecture Notes in Computer Science 2054, 2001, pp. 27–42.
3. Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing;Guo;Parallel Computing,2004
4. Fast parallel solution for set-packing and clique problems by DNA-based computing;Ho;IEICE Transactions on Information and Systems,2004
5. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing;Guo;Biosystems,2005
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献