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.
130 related articles for article (PubMed ID: 10597033)
21. Optimal parallel algorithm for shortest paths problem on interval graphs. Mishra PK J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010 [TBL] [Abstract][Full Text] [Related]
22. A Parallel DNA Algorithm for Solving the Quota Traveling Salesman Problem Based on Biocomputing Model. Wang Z; Wu X; Wu T Comput Intell Neurosci; 2022; 2022():1450756. PubMed ID: 36093485 [TBL] [Abstract][Full Text] [Related]
23. Solving satisfiability problems using a novel microarray-based DNA computer. Lin CH; Cheng HP; Yang CB; Yang CN Biosystems; 2007; 90(1):242-52. PubMed ID: 17029765 [TBL] [Abstract][Full Text] [Related]
24. Single-stranded DNA library preparation for the sequencing of ancient or damaged DNA. Gansauge MT; Meyer M Nat Protoc; 2013 Apr; 8(4):737-48. PubMed ID: 23493070 [TBL] [Abstract][Full Text] [Related]
25. Immobilization of DNA in polyacrylamide gel for the manufacture of DNA and DNA-oligonucleotide microchips. Proudnikov D; Timofeev E; Mirzabekov A Anal Biochem; 1998 May; 259(1):34-41. PubMed ID: 9606140 [TBL] [Abstract][Full Text] [Related]
26. Production of random DNA oligomers for scalable DNA computing. Wang SS; Johnson JJ; Hughes BS; Karabay DA; Bader KD; Austin A; Habib A; Hatef H; Joshi M; Nguyen L; Mills AP Biotechnol J; 2009 Jan; 4(1):119-28. PubMed ID: 19156734 [TBL] [Abstract][Full Text] [Related]
27. DNA solution of the maximal clique problem. Ouyang Q; Kaplan PD; Liu S; Libchaber A Science; 1997 Oct; 278(5337):446-9. PubMed ID: 9334300 [TBL] [Abstract][Full Text] [Related]
28. Solution of a 20-variable 3-SAT problem on a DNA computer. Braich RS; Chelyapov N; Johnson C; Rothemund PW; Adleman L Science; 2002 Apr; 296(5567):499-502. PubMed ID: 11896237 [TBL] [Abstract][Full Text] [Related]
29. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem. Wang ZC; Wu X; Liang K; Wu TH IEEE Trans Nanobioscience; 2024 Jul; 23(3):391-402. PubMed ID: 38709614 [TBL] [Abstract][Full Text] [Related]
30. New sufficient conditions for Hamiltonian paths. Rahman MS; Kaykobad M; Firoz JS ScientificWorldJournal; 2014; 2014():743431. PubMed ID: 25045745 [TBL] [Abstract][Full Text] [Related]
31. A path recorder algorithm for Multiple Longest Common Subsequences (MLCS) problems. Wei S; Wang Y; Yang Y; Liu S Bioinformatics; 2020 May; 36(10):3035-3042. PubMed ID: 32119070 [TBL] [Abstract][Full Text] [Related]
32. 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]
33. Path matching and graph matching in biological networks. Yang Q; Sze SH J Comput Biol; 2007; 14(1):56-67. PubMed ID: 17381346 [TBL] [Abstract][Full Text] [Related]
34. Is optimal solution of every NP-complete or NP-hard problem determined from its characteristic for DNA-based computing. Guo M; Chang WL; Ho M; Lu J; Cao J Biosystems; 2005 Apr; 80(1):71-82. PubMed ID: 15740836 [TBL] [Abstract][Full Text] [Related]
36. A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model. Wang Z; Ji Z; Wang X; Wu T; Huang W Biosystems; 2017 Dec; 162():59-65. PubMed ID: 28890344 [TBL] [Abstract][Full Text] [Related]
39. Scalability of the surface-based DNA algorithm for 3-SAT. Li D; Li X; Huang H; Li X Biosystems; 2006 Aug; 85(2):95-8. PubMed ID: 16423447 [TBL] [Abstract][Full Text] [Related]
40. Computing with DNA by operating on plasmids. Head T; Rozenberg G; Bladergroen RS; Breek CK; Lommerse PH; Spaink HP Biosystems; 2000 Jul; 57(2):87-93. PubMed ID: 11004388 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]