268 related articles for article (PubMed ID: 19505531)
1. 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]
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. DNA algorithm for an unbounded fan-in Boolean circuit.
Ahrabian H; Ganjtabesh M; Nowzari-Dalini A
Biosystems; 2005 Oct; 82(1):52-60. PubMed ID: 15982801
[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. 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]
6. 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]
7. 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]
8. 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]
9. 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]
10. Towards computing with proteins.
Unger R; Moult J
Proteins; 2006 Apr; 63(1):53-64. PubMed ID: 16435369
[TBL] [Abstract][Full Text] [Related]
11. Molecular solutions to the binary integer programming problem based on DNA computation.
Yeh CW; Chu CP; Wu KR
Biosystems; 2006 Jan; 83(1):56-66. PubMed ID: 16229936
[TBL] [Abstract][Full Text] [Related]
12. Solving the 3-SAT problem based on DNA computing.
Liu W; Gao L; Liu X; Wang S; Xu J
J Chem Inf Comput Sci; 2003; 43(6):1872-5. PubMed ID: 14632435
[TBL] [Abstract][Full Text] [Related]
13. 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]
14. 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]
15. Molecular solutions for the subset-sum problem on DNA-based supercomputing.
Chang WL; Ho MS; Guo M
Biosystems; 2004 Feb; 73(2):117-30. PubMed ID: 15013224
[TBL] [Abstract][Full Text] [Related]
16. DNA logic gates.
Okamoto A; Tanaka K; Saito I
J Am Chem Soc; 2004 Aug; 126(30):9458-63. PubMed ID: 15281839
[TBL] [Abstract][Full Text] [Related]
17. Sign-representation of Boolean functions using a small number of monomials.
Oztop E
Neural Netw; 2009 Sep; 22(7):938-48. PubMed ID: 19423284
[TBL] [Abstract][Full Text] [Related]
18. 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]
19. 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]
20. Automated design of image operators that detect interest points.
Trujillo L; Olague G
Evol Comput; 2008; 16(4):483-507. PubMed ID: 19053496
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
