407 related articles for article (PubMed ID: 17029765)
21. 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]
22. DNA-based computing of strategic assignment problems.
Shu JJ; Wang QW; Yong KY
Phys Rev Lett; 2011 May; 106(18):188702. PubMed ID: 21635133
[TBL] [Abstract][Full Text] [Related]
23. 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]
24. DNA computing the Hamiltonian path problem.
Lee CM; Kim SW; Kim SM; Sohn U
Mol Cells; 1999 Oct; 9(5):464-9. PubMed ID: 10597033
[TBL] [Abstract][Full Text] [Related]
25. 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]
26. Fast calculation of pairwise mutual information for gene regulatory network reconstruction.
Qiu P; Gentles AJ; Plevritis SK
Comput Methods Programs Biomed; 2009 May; 94(2):177-80. PubMed ID: 19167129
[TBL] [Abstract][Full Text] [Related]
27. Solving the fully-connected 15-city TSP using probabilistic DNA computing.
Xiong F; Spetzler D; Frasch WD
Integr Biol (Camb); 2009 Mar; 1(3):275-80. PubMed ID: 20023738
[TBL] [Abstract][Full Text] [Related]
28. Weighted lasso in graphical Gaussian modeling for large gene network estimation based on microarray data.
Shimamura T; Imoto S; Yamaguchi R; Miyano S
Genome Inform; 2007; 19():142-53. PubMed ID: 18546512
[TBL] [Abstract][Full Text] [Related]
29. DNA approach to solve clustering problem based on a mutual order.
Bakar RB; Watada J; Pedrycz W
Biosystems; 2008 Jan; 91(1):1-12. PubMed ID: 17669585
[TBL] [Abstract][Full Text] [Related]
30. 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]
31. A new DNA computing model for the NAND gate based on induced hairpin formation.
Liu W; Shi X; Zhang S; Liu X; Xu J
Biosystems; 2004 Nov; 77(1-3):87-92. PubMed ID: 15527948
[TBL] [Abstract][Full Text] [Related]
32. Numerical characterization of DNA sequences based on digital signal method.
Qi ZH; Qi XQ
Comput Biol Med; 2009 Apr; 39(4):388-91. PubMed ID: 19261267
[TBL] [Abstract][Full Text] [Related]
33. 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]
34. Towards computing with proteins.
Unger R; Moult J
Proteins; 2006 Apr; 63(1):53-64. PubMed ID: 16435369
[TBL] [Abstract][Full Text] [Related]
35. 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]
36. 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]
37. The simulation of the three-dimensional lattice hydrophobic-polar protein folding.
Guo YZ; Feng EM
J Chem Phys; 2006 Dec; 125(23):234703. PubMed ID: 17190566
[TBL] [Abstract][Full Text] [Related]
38. [Progress in molecular biology study of DNA computer].
Zhang ZZ; Zhao J; He L
Yi Chuan Xue Bao; 2003 Sep; 30(9):886-92. PubMed ID: 14577383
[TBL] [Abstract][Full Text] [Related]
39. 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]
40. A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem.
García-Arnau M; Manrique D; Rodríguez-Patón A; Sosík P
Biosystems; 2007; 90(3):687-97. PubMed ID: 17418940
[TBL] [Abstract][Full Text] [Related]
[Previous] [Next] [New Search]
