235 related articles for article (PubMed ID: 15740839)
1. 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]
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. 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. 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]
6. Molecular computing revisited: a Moore's Law?
Livstone MS; van Noort D; Landweber LF
Trends Biotechnol; 2003 Mar; 21(3):98-101. PubMed ID: 12628362
[TBL] [Abstract][Full Text] [Related]
7. Alignment-based approach for durable data storage into living organisms.
Yachie N; Sekiyama K; Sugahara J; Ohashi Y; Tomita M
Biotechnol Prog; 2007; 23(2):501-5. PubMed ID: 17253725
[TBL] [Abstract][Full Text] [Related]
8. DNA databases.
Schuster A
Biosystems; 2005 Sep; 81(3):234-46. PubMed ID: 15979233
[TBL] [Abstract][Full Text] [Related]
9. Playing to win at DNA computation.
Tabor JJ; Ellington AD
Nat Biotechnol; 2003 Sep; 21(9):1013-5. PubMed ID: 12949563
[No Abstract] [Full Text] [Related]
10. A new approach to data storage using localized structures.
Coullet P; Riera C; Tresser C
Chaos; 2004 Mar; 14(1):193-8. PubMed ID: 15003061
[TBL] [Abstract][Full Text] [Related]
11. 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]
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. Simulation-based comparison of cell design concepts for phase change random access memory.
Kim DH; Merget F; Först M; Kurz H
J Nanosci Nanotechnol; 2007 Jan; 7(1):298-305. PubMed ID: 17455495
[TBL] [Abstract][Full Text] [Related]
14. Fast parallel molecular algorithms for DNA-based computation: factoring integers.
Chang WL; Guo M; Ho MS
IEEE Trans Nanobioscience; 2005 Jun; 4(2):149-63. PubMed ID: 16117023
[TBL] [Abstract][Full Text] [Related]
15. Towards computing with proteins.
Unger R; Moult J
Proteins; 2006 Apr; 63(1):53-64. PubMed ID: 16435369
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. A deoxyribozyme-based molecular automaton.
Stojanovic MN; Stefanovic D
Nat Biotechnol; 2003 Sep; 21(9):1069-74. PubMed ID: 12923549
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. Two operative concepts for the post-genomic era: the "mémoire vive" of the cell and a molecular algebra.
Bentolila S
Proc IEEE Comput Soc Bioinform Conf; 2003; 2():114-22. PubMed ID: 16452785
[TBL] [Abstract][Full Text] [Related]
20. Procedures for a dynamical system on {0,1}n with DNA molecules.
Xiao D; Li W; Yu J; Zhang X; Zhang Z; He L
Biosystems; 2006 Jun; 84(3):207-16. PubMed ID: 16388887
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
