236 related articles for article (PubMed ID: 10646598)
1. DNA computing on surfaces.
Liu Q; Wang L; Frutos AG; Condon AE; Corn RM; Smith LM
Nature; 2000 Jan; 403(6766):175-9. PubMed ID: 10646598
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. DNA computing using single-molecule hybridization detection.
Schmidt KA; Henkel CV; Rozenberg G; Spaink HP
Nucleic Acids Res; 2004; 32(17):4962-8. PubMed ID: 15388798
[TBL] [Abstract][Full Text] [Related]
9. 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]
10. Solving traveling salesman problems with DNA molecules encoding numerical values.
Lee JY; Shin SY; Park TH; Zhang BT
Biosystems; 2004 Dec; 78(1-3):39-47. PubMed ID: 15555757
[TBL] [Abstract][Full Text] [Related]
11. A general resolution of intractable problems in polynomial time through DNA Computing.
Sanches CA; Soma NY
Biosystems; 2016 Dec; 150():119-131. PubMed ID: 27693626
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. 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]
14. A Chinese Postman Problem based on DNA computing.
Yin Z; Zhang F; Xu J
J Chem Inf Comput Sci; 2002; 42(2):222-4. PubMed ID: 11911690
[TBL] [Abstract][Full Text] [Related]
15. Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.
Aono M; Naruse M; Kim SJ; Wakabayashi M; Hori H; Ohtsu M; Hara M
Langmuir; 2013 Jun; 29(24):7557-64. PubMed ID: 23565603
[TBL] [Abstract][Full Text] [Related]
16. A surface-based approach to DNA computation.
Smith LM; Corn RM; Condon AE; Lagally MG; Frutos AG; Liu Q; Thiel AJ
J Comput Biol; 1998; 5(2):255-67. PubMed ID: 9672831
[TBL] [Abstract][Full Text] [Related]
17. [Analysis, identification and correction of some errors of model refseqs appeared in NCBI Human Gene Database by in silico cloning and experimental verification of novel human genes].
Zhang DL; Ji L; Li YD
Yi Chuan Xue Bao; 2004 May; 31(5):431-43. PubMed ID: 15478601
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. Solving multiconstraint assignment problems using learning automata.
Horn G; Oommen BJ
IEEE Trans Syst Man Cybern B Cybern; 2010 Feb; 40(1):6-18. PubMed ID: 19884057
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
