136 related articles for article (PubMed ID: 14643494)
1. Solving the set cover problem and the problem of exact cover by 3-sets in the Adleman-Lipton model.
Chang WL; Guo M
Biosystems; 2003 Dec; 72(3):263-75. PubMed ID: 14643494
[TBL] [Abstract][Full Text] [Related]
2. A novel bio-heuristic computing algorithm to solve the capacitated vehicle routing problem based on Adleman-Lipton model.
Wang Z; Ren X; Ji Z; Huang W; Wu T
Biosystems; 2019 Oct; 184():103997. PubMed ID: 31369836
[TBL] [Abstract][Full Text] [Related]
3. Solving maximum cut problems in the Adleman-Lipton model.
Xiao D; Li W; Zhang Z; He L
Biosystems; 2005 Dec; 82(3):203-7. PubMed ID: 16236426
[TBL] [Abstract][Full Text] [Related]
4. 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]
5. 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]
6. 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]
7. 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]
8. Solving the Family Traveling Salesperson Problem in the Adleman-Lipton Model Based on DNA Computing.
Wu X; Wang Z; Wu T; Bao X
IEEE Trans Nanobioscience; 2022 Jan; 21(1):75-85. PubMed ID: 34460379
[TBL] [Abstract][Full Text] [Related]
9. A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model.
Tian X; Liu X; Zhang H; Sun M; Zhao Y
PLoS One; 2020; 15(12):e0242083. PubMed ID: 33264317
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. 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]
12. Molecular solutions to the binary integer programming problem based on DNA computation.
Yeh CW; Chu CP; Wu KR
Biosystems; 2006 Jan; 83(1):56-66. PubMed ID: 16229936
[TBL] [Abstract][Full Text] [Related]
13. In Vitro Identification of the Hamiltonian Cycle Using a Circular Structure Assisted DNA Computer.
Sharma D; Ramteke M
ACS Comb Sci; 2020 May; 22(5):225-231. PubMed ID: 32212630
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. 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]
17. 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]
18. Hairpin formation in DNA computation presents limits for large NP-complete problems.
Li D; Huang H; Li X; Li X
Biosystems; 2003 Dec; 72(3):203-7. PubMed ID: 14643488
[TBL] [Abstract][Full Text] [Related]
19. Parallelizing Assignment Problem with DNA Strands.
Khorsand B; Savadi A; Naghibzadeh M
Iran J Biotechnol; 2020 Jan; 18(1):e2547. PubMed ID: 32884959
[TBL] [Abstract][Full Text] [Related]
20. The k partition-distance problem.
Chen YH
J Comput Biol; 2012 Apr; 19(4):404-17. PubMed ID: 22468708
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
