189 related articles for article (PubMed ID: 21742570)
1. 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]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. A novel generalized design methodology and realization of Boolean operations using DNA.
Zoraida BS; Arock M; Ronald BS; Ponalagusamy R
Biosystems; 2009 Sep; 97(3):146-53. PubMed ID: 19505531
[TBL] [Abstract][Full Text] [Related]
9. A DNA algorithm for the graph coloring problem.
Liu W; Zhang F; Xu J
J Chem Inf Comput Sci; 2002; 42(5):1176-8. PubMed ID: 12377006
[TBL] [Abstract][Full Text] [Related]
10. Potential for enlarging DNA memory: the validity of experimental operations of scaled-up nested primer molecular memory.
Kashiwamura S; Yamamoto M; Kameda A; Shiba T; Ohuchi A
Biosystems; 2005 Apr; 80(1):99-112. PubMed ID: 15740839
[TBL] [Abstract][Full Text] [Related]
11. A DNA computing readout operation based on structure-specific cleavage.
Wang L; Hall JG; Lu M; Liu Q; Smith LM
Nat Biotechnol; 2001 Nov; 19(11):1053-9. PubMed ID: 11689851
[TBL] [Abstract][Full Text] [Related]
12. Markov chains: computing limit existence and approximations with DNA.
Cardona M; Colomer MA; Conde J; Miret JM; MirĂ³ J; Zaragoza A
Biosystems; 2005 Sep; 81(3):261-6. PubMed ID: 15982800
[TBL] [Abstract][Full Text] [Related]
13. DNA polymerase programmed with a hairpin DNA incorporates a multiple-instruction architecture into molecular computing.
Komiya K; Sakamoto K; Kameda A; Yamamoto M; Ohuchi A; Kiga D; Yokoyama S; Hagiya M
Biosystems; 2006 Jan; 83(1):18-25. PubMed ID: 16343736
[TBL] [Abstract][Full Text] [Related]
14. Solving the SAT problem using a DNA computing algorithm based on ligase chain reaction.
Wang X; Bao Z; Hu J; Wang S; Zhan A
Biosystems; 2008 Jan; 91(1):117-25. PubMed ID: 17904730
[TBL] [Abstract][Full Text] [Related]
15. Public-key system using DNA as a one-way function for key distribution.
Tanaka K; Okamoto A; Saito I
Biosystems; 2005 Jul; 81(1):25-9. PubMed ID: 15917125
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. 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]
18. 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]
19. 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]
20. 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]
[Next] [New Search]