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 *

189 related articles for article (PubMed ID: 21511001)

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

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

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

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

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

  • 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. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding.
    Guturu P; Dantu R
    IEEE Trans Syst Man Cybern B Cybern; 2008 Jun; 38(3):645-66. PubMed ID: 18558530
    [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. 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]  

  • 11. DNA strand generation for DNA computing by using a multi-objective differential evolution algorithm.
    Chaves-González JM; Vega-Rodríguez MA
    Biosystems; 2014 Feb; 116():49-64. PubMed ID: 24361487
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 15. A Novel Algorithm for Solving the Prize Collecting Traveling Salesman Problem Based on DNA Computing.
    Wang ZC; Liang K; Bao XG; Wu TH
    IEEE Trans Nanobioscience; 2024 Apr; 23(2):220-232. PubMed ID: 37607150
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Effective Memetic Algorithms for VLSI design = Genetic Algorithms + local search + multi-level clustering.
    Areibi S; Yang Z
    Evol Comput; 2004; 12(3):327-53. PubMed ID: 15355604
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Molecular Sticker Model Stimulation on Silicon for a Maximum Clique Problem.
    Ning J; Li Y; Yu W
    Int J Mol Sci; 2015 Jun; 16(6):13474-89. PubMed ID: 26075867
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 10.