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 *

267 related articles for article (PubMed ID: 15917122)

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

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

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

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

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

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

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

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

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

  • 12. The hierarchical fair competition (HFC) framework for sustainable evolutionary algorithms.
    Hu J; Goodman E; Seo K; Fan Z; Rosenberg R
    Evol Comput; 2005; 13(2):241-77. PubMed ID: 15969902
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. GASAT: a genetic local search algorithm for the satisfiability problem.
    Lardeux F; Saubion F; Hao JK
    Evol Comput; 2006; 14(2):223-53. PubMed ID: 16831107
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 17. Bidirectional sticker systems.
    Freund R; Păun G; Rozenberg G; Salomaa A
    Pac Symp Biocomput; 1998; ():535-46. PubMed ID: 9697210
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. Public-key system using DNA as a one-way function for key distribution.
    Tanaka K; Okamoto A; Saito I
    Biosystems; 2005 Jul; 81(1):25-9. PubMed ID: 15917125
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Solution of a 20-variable 3-SAT problem on a DNA computer.
    Braich RS; Chelyapov N; Johnson C; Rothemund PW; Adleman L
    Science; 2002 Apr; 296(5567):499-502. PubMed ID: 11896237
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 14.