478 related articles for article (PubMed ID: 23871964)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. 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]
9. A new solution for maximal clique problem based sticker model.
Darehmiraki M
Biosystems; 2009 Feb; 95(2):145-9. PubMed ID: 18992786
[TBL] [Abstract][Full Text] [Related]
10. An unenumerative DNA computing model for vertex coloring problem.
Xu J; Qiang X; Yang Y; Wang B; Yang D; Luo L; Pan L; Wang S
IEEE Trans Nanobioscience; 2011 Jun; 10(2):94-8. PubMed ID: 21742570
[TBL] [Abstract][Full Text] [Related]
11. 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]
12. DNA computation model to solve 0-1 programming problem.
Zhang F; Yin Z; Liu B; Xu J
Biosystems; 2004; 74(1-3):9-14. PubMed ID: 15125989
[TBL] [Abstract][Full Text] [Related]
13. Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
Ishida Y; Zhao L; Nagamochi H; Akutsu T
Genome Inform; 2008; 21():53-64. PubMed ID: 19425147
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. 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]
16. On Single-Objective Sub-Graph-Based Mutation for Solving the Bi-Objective Minimum Spanning Tree Problem.
Bossek J; Grimme C
Evol Comput; 2024 Jun; 32(2):143-175. PubMed ID: 37290030
[TBL] [Abstract][Full Text] [Related]
17. A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem.
García-Arnau M; Manrique D; Rodríguez-Patón A; Sosík P
Biosystems; 2007; 90(3):687-97. PubMed ID: 17418940
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. Quantum Speedup and Mathematical Solutions of Implementing Bio-Molecular Solutions for the Independent Set Problem on IBM Quantum Computers.
Chang WL; Chen JC; Chung WY; Hsiao CY; Wong R; Vasilakos AV
IEEE Trans Nanobioscience; 2021 Jul; 20(3):354-376. PubMed ID: 33900920
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
