These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
2. DNA computing the Hamiltonian path problem. Lee CM; Kim SW; Kim SM; Sohn U Mol Cells; 1999 Oct; 9(5):464-9. PubMed ID: 10597033 [TBL] [Abstract][Full Text] [Related]
3. A Chinese Postman Problem based on DNA computing. Yin Z; Zhang F; Xu J J Chem Inf Comput Sci; 2002; 42(2):222-4. PubMed ID: 11911690 [TBL] [Abstract][Full Text] [Related]
4. On the path to computation with DNA. Gifford DK Science; 1994 Nov; 266(5187):993-4. PubMed ID: 7973681 [No Abstract] [Full Text] [Related]
10. The fidelity of template-directed oligonucleotide ligation and its relevance to DNA computation. James KD; Boles AR; Henckel D; Ellington AD Nucleic Acids Res; 1998 Nov; 26(22):5203-11. PubMed ID: 9801320 [TBL] [Abstract][Full Text] [Related]
11. A surface-based approach to DNA computation. Smith LM; Corn RM; Condon AE; Lagally MG; Frutos AG; Liu Q; Thiel AJ J Comput Biol; 1998; 5(2):255-67. PubMed ID: 9672831 [TBL] [Abstract][Full Text] [Related]
12. DNA computation: theory, practice, and prospects. Maley CC Evol Comput; 1998; 6(3):201-29. PubMed ID: 10021747 [TBL] [Abstract][Full Text] [Related]
13. Solving a Hamiltonian Path Problem with a bacterial computer. Baumgardner J; Acker K; Adefuye O; Crowley ST; Deloache W; Dickson JO; Heard L; Martens AT; Morton N; Ritter M; Shoecraft A; Treece J; Unzicker M; Valencia A; Waters M; Campbell AM; Heyer LJ; Poet JL; Eckdahl TT J Biol Eng; 2009 Jul; 3():11. PubMed ID: 19630940 [TBL] [Abstract][Full Text] [Related]
14. DNA computing using single-molecule hybridization detection. Schmidt KA; Henkel CV; Rozenberg G; Spaink HP Nucleic Acids Res; 2004; 32(17):4962-8. PubMed ID: 15388798 [TBL] [Abstract][Full Text] [Related]
15. DNA polymerase programmed with a hairpin DNA incorporates a multiple-instruction architecture into molecular computing. Komiya K; Sakamoto K; Kameda A; Yamamoto M; Ohuchi A; Kiga D; Yokoyama S; Hagiya M Biosystems; 2006 Jan; 83(1):18-25. PubMed ID: 16343736 [TBL] [Abstract][Full Text] [Related]
16. Fast parallel DNA-based algorithms for molecular computation: the set-partition problem. Chang WL IEEE Trans Nanobioscience; 2007 Dec; 6(4):346-53. PubMed ID: 18217628 [TBL] [Abstract][Full Text] [Related]
17. DNA computing on surfaces. Liu Q; Wang L; Frutos AG; Condon AE; Corn RM; Smith LM Nature; 2000 Jan; 403(6766):175-9. PubMed ID: 10646598 [TBL] [Abstract][Full Text] [Related]
18. Solving traveling salesman problems with DNA molecules encoding numerical values. Lee JY; Shin SY; Park TH; Zhang BT Biosystems; 2004 Dec; 78(1-3):39-47. PubMed ID: 15555757 [TBL] [Abstract][Full Text] [Related]
19. Graph Computation Using Algorithmic Self-Assembly of DNA Molecules. Xu J; Chen C; Shi X ACS Synth Biol; 2022 Jul; 11(7):2456-2463. PubMed ID: 35703038 [TBL] [Abstract][Full Text] [Related]
20. The surface-based approach for DNA computation is unreliable for SAT. Li D; Li X; Huang H; Li X Biosystems; 2005 Oct; 82(1):20-5. PubMed ID: 16024166 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]