Author:
Liu Qinghua,Wang Liman,Frutos Anthony G.,Condon Anne E.,Corn Robert M.,Smith Lloyd M.
Publisher
Springer Science and Business Media LLC
Reference33 articles.
1. Adleman, L. M. Molecular computation of solutions to combinatorial problems. Science 266, 1021–1024 ( 1994).
2. Garey, M. R. & Johnson, D. S. Computers and Intractability: a Guide to the Theory of NP-completeness (Freeman, New York, 1979).
3. Adleman, L. M. Computing with DNA. Sci. Am. 279, 54– 61 (1998).
4. Lipton, R. J. DNA solution of hard computational problems. Science 268, 542–545 (1995).
5. Guarnieri, F., Fliss, M. & Bancroft, C. Making DNA add. Science 273, 220–223 (1996).
Cited by
393 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献