181 related articles for article (PubMed ID: 15597116)
1. The emergence of complexity: lessons from DNA.
Mao C
PLoS Biol; 2004 Dec; 2(12):e431. PubMed ID: 15597116
[TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. 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]
5. 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]
6. 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]
7. 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]
8. The general form of 0-1 programming problem based on DNA computing.
ZhiXiang Y; Fengyue Z; Jin X
Biosystems; 2003 Jun; 70(1):73-8. PubMed ID: 12753938
[TBL] [Abstract][Full Text] [Related]
9. Towards computing with proteins.
Unger R; Moult J
Proteins; 2006 Apr; 63(1):53-64. PubMed ID: 16435369
[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. Algorithmic self-assembly of DNA Sierpinski triangles.
Rothemund PW; Papadakis N; Winfree E
PLoS Biol; 2004 Dec; 2(12):e424. PubMed ID: 15583715
[TBL] [Abstract][Full Text] [Related]
12. Fast parallel molecular solutions for DNA-based supercomputing: the subset-product problem.
Ho MS
Biosystems; 2005 Jun; 80(3):233-50. PubMed ID: 15981311
[TBL] [Abstract][Full Text] [Related]
13. Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.
Chang WL
IEEE Trans Nanobioscience; 2007 Dec; 6(4):346-53. PubMed ID: 18217628
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Axis curvature and ligand induced bending in the CAP-DNA oligomers.
Dixit SB; Beveridge DL
Biophys J; 2005 Jan; 88(1):L04-6. PubMed ID: 15556974
[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. An improved heuristic algorithm for finding motif signals in DNA sequences.
Huang CW; Lee WS; Hsieh SY
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(4):959-75. PubMed ID: 20855921
[TBL] [Abstract][Full Text] [Related]
18. Logic circuits based on molecular spider systems.
Mo D; Lakin MR; Stefanovic D
Biosystems; 2016 Aug; 146():10-25. PubMed ID: 27085223
[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. Exploring the Potential of DNA Computing for Complex Big Data Problems: A Case Study on the Traveling Car Renter Problem.
Wang ZC; Wu X; Liang K; Wu TH
IEEE Trans Nanobioscience; 2024 Jul; 23(3):391-402. PubMed ID: 38709614
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
