213 related articles for article (PubMed ID: 26075867)
1. Molecular Sticker Model Stimulation on Silicon for a Maximum Clique Problem.
Ning J; Li Y; Yu W
Int J Mol Sci; 2015 Jun; 16(6):13474-89. PubMed ID: 26075867
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. A CLIQUE algorithm using DNA computing techniques based on closed-circle DNA sequences.
Zhang H; Liu X
Biosystems; 2011 Jul; 105(1):73-82. PubMed ID: 21511001
[TBL] [Abstract][Full Text] [Related]
5. 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]
6. Applying DNA computation to intractable problems in social network analysis.
Chen RC; Yang SJ
Biosystems; 2010 Sep; 101(3):222-32. PubMed ID: 20566337
[TBL] [Abstract][Full Text] [Related]
7. [DNA computing].
Błasiak J; Krasiński T; Popławski T; Sakowski S
Postepy Biochem; 2011; 57(1):13-23. PubMed ID: 21735816
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. 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]
10. 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]
11. 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]
12. 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]
13. 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]
14. A sticker-based model for DNA computation.
Roweis S; Winfree E; Burgoyne R; Chelyapov NV; Goodman MF; Rothemund PW; Adleman LM
J Comput Biol; 1998; 5(4):615-29. PubMed ID: 10072080
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. 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]
17. Amorphous computing in the presence of stochastic disturbances.
Chu D; Barnes DJ; Perkins S
Biosystems; 2014 Nov; 125():32-42. PubMed ID: 25263683
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA.
Currin A; Korovin K; Ababi M; Roper K; Kell DB; Day PJ; King RD
J R Soc Interface; 2017 Mar; 14(128):. PubMed ID: 28250099
[TBL] [Abstract][Full Text] [Related]
20. 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]
[Next] [New Search]
