125 related articles for article (PubMed ID: 32212630)
21. The bounded complexity of DNA computing.
Garzon MH; Jonoska N; Karl SA
Biosystems; 1999 Oct; 52(1-3):63-72. PubMed ID: 10636031
[TBL] [Abstract][Full Text] [Related]
22. The general form of 0-1 programming problem based on DNA computing.
ZhiXiang Y; Fengyue Z; Jin X
Biosystems; 2003 Jun; 70(1):73-8. PubMed ID: 12753938
[TBL] [Abstract][Full Text] [Related]
23. DNA-based computing of strategic assignment problems.
Shu JJ; Wang QW; Yong KY
Phys Rev Lett; 2011 May; 106(18):188702. PubMed ID: 21635133
[TBL] [Abstract][Full Text] [Related]
24. A Parallel Biological Optimization Algorithm to Solve the Unbalanced Assignment Problem Based on DNA Molecular Computing.
Wang Z; Pu J; Cao L; Tan J
Int J Mol Sci; 2015 Oct; 16(10):25338-52. PubMed ID: 26512650
[TBL] [Abstract][Full Text] [Related]
25. A parallel algorithm for solving the n-queens problem based on inspired computational model.
Wang Z; Huang D; Tan J; Liu T; Zhao K; Li L
Biosystems; 2015 May; 131():22-9. PubMed ID: 25817410
[TBL] [Abstract][Full Text] [Related]
26. Magnetization of circular DNA.
Kim S; Yi J; Choi MY
Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Jul; 76(1 Pt 1):012902. PubMed ID: 17677517
[TBL] [Abstract][Full Text] [Related]
27. Solving the 3-SAT problem based on DNA computing.
Liu W; Gao L; Liu X; Wang S; Xu J
J Chem Inf Comput Sci; 2003; 43(6):1872-5. PubMed ID: 14632435
[TBL] [Abstract][Full Text] [Related]
28. Biomolecular computing: is it ready to take off?
Fu P
Biotechnol J; 2007 Jan; 2(1):91-101. PubMed ID: 17183505
[TBL] [Abstract][Full Text] [Related]
29. An O(2n) volume molecular algorithm for Hamiltonian path.
Fu B; Beigel R; Zhou FX
Biosystems; 1999 Oct; 52(1-3):217-26. PubMed ID: 10636047
[TBL] [Abstract][Full Text] [Related]
30. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
Wang Z; Huang D; Meng H; Tang C
Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
[TBL] [Abstract][Full Text] [Related]
31. Solving the fully-connected 15-city TSP using probabilistic DNA computing.
Xiong F; Spetzler D; Frasch WD
Integr Biol (Camb); 2009 Mar; 1(3):275-80. PubMed ID: 20023738
[TBL] [Abstract][Full Text] [Related]
32. The evolution of cellular computing: nature's solution to a computational problem.
Landweber LF; Kari L
Biosystems; 1999 Oct; 52(1-3):3-13. PubMed ID: 10636025
[TBL] [Abstract][Full Text] [Related]
33. 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]
34. Optical solver of combinatorial problems: nanotechnological approach.
Cohen E; Dolev S; Frenkel S; Kryzhanovsky B; Palagushkin A; Rosenblit M; Zakharov V
J Opt Soc Am A Opt Image Sci Vis; 2013 Sep; 30(9):1845-53. PubMed ID: 24323266
[TBL] [Abstract][Full Text] [Related]
35. 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]
36. 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]
37. A new DNA computing model for the NAND gate based on induced hairpin formation.
Liu W; Shi X; Zhang S; Liu X; Xu J
Biosystems; 2004 Nov; 77(1-3):87-92. PubMed ID: 15527948
[TBL] [Abstract][Full Text] [Related]
38. Solving the 0/1 knapsack problem by a biomolecular DNA computer.
Taghipour H; Rezaei M; Esmaili HA
Adv Bioinformatics; 2013; 2013():341419. PubMed ID: 23509451
[TBL] [Abstract][Full Text] [Related]
39. A DNA solution of SAT problem by a modified sticker model.
Yang CN; Yang CB
Biosystems; 2005 Jul; 81(1):1-9. PubMed ID: 15917122
[TBL] [Abstract][Full Text] [Related]
40. Differential dependence on DNA ligase of type II restriction enzymes: a practical way toward ligase-free DNA automaton.
Chen P; Li J; Zhao J; He L; Zhang Z
Biochem Biophys Res Commun; 2007 Feb; 353(3):733-7. PubMed ID: 17196173
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
