These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

130 related articles for article (PubMed ID: 16860927)

  • 1. DNA computing of solutions to knapsack problems.
    Henkel CV; Bäck T; Kok JN; Rozenberg G; Spaink HP
    Biosystems; 2007 Mar; 88(1-2):156-62. PubMed ID: 16860927
    [TBL] [Abstract][Full Text] [Related]  

  • 2. 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]  

  • 3. 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]  

  • 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. 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]  

  • 6. Applying DNA computation to intractable problems in social network analysis.
    Chen RC; Yang SJ
    Biosystems; 2010 Sep; 101(3):222-32. PubMed ID: 20566337
    [TBL] [Abstract][Full Text] [Related]  

  • 7. 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]  

  • 8. 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]  

  • 9. Solving the 0/1 knapsack problem by a biomolecular DNA computer.
    Taghipour H; Rezaei M; Esmaili HA
    Adv Bioinformatics; 2013; 2013():341419. PubMed ID: 23509451
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Solving the multiple competitive facilities location and design problem on the plane.
    Redondo JL; Fernández J; García I; Ortigosa PM
    Evol Comput; 2009; 17(1):21-53. PubMed ID: 19207087
    [TBL] [Abstract][Full Text] [Related]  

  • 11. 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]  

  • 12. 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]  

  • 13. Parallel overlap assembly for the construction of computational DNA libraries.
    Kaplan PD; Ouyang Q; Thaler DS; Libchaber A
    J Theor Biol; 1997 Oct; 188(3):333-41. PubMed ID: 9344738
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Identification of hits and lead structure candidates with limited resources by adaptive optimization.
    Schüller A; Schneider G
    J Chem Inf Model; 2008 Jul; 48(7):1473-91. PubMed ID: 18590273
    [TBL] [Abstract][Full Text] [Related]  

  • 15. 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]  

  • 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. 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]  

  • 18. Optimizing scaleup yield for protein production: Computationally Optimized DNA Assembly (CODA) and Translation Engineering.
    Hatfield GW; Roth DA
    Biotechnol Annu Rev; 2007; 13():27-42. PubMed ID: 17875472
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Modeling and efficient optimization for object-based scalability and some related problems.
    Batra P
    IEEE Trans Image Process; 2000; 9(10):1677-92. PubMed ID: 18262907
    [TBL] [Abstract][Full Text] [Related]  

  • 20. 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]  

    [Next]    [New Search]
    of 7.