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 *

140 related articles for article (PubMed ID: 11248014)

  • 1. Using three-dimensional microfluidic networks for solving computationally hard problems.
    Chiu DT; Pezzoli E; Wu H; Stroock AD; Whitesides GM
    Proc Natl Acad Sci U S A; 2001 Mar; 98(6):2961-6. PubMed ID: 11248014
    [TBL] [Abstract][Full Text] [Related]  

  • 2. An efficient approximation algorithm for finding a maximum clique using Hopfield network learning.
    Wang RL; Tang Z; Cao QP
    Neural Comput; 2003 Jul; 15(7):1605-19. PubMed ID: 12816568
    [TBL] [Abstract][Full Text] [Related]  

  • 3. A parallel algorithm for solving the n-queens problem based on inspired computational model.
    Wang Z; Huang D; Tan J; Liu T; Zhao K; Li L
    Biosystems; 2015 May; 131():22-9. PubMed ID: 25817410
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A minimum resource neural network framework for solving multiconstraint shortest path problems.
    Zhang J; Zhao X; He X
    IEEE Trans Neural Netw Learn Syst; 2014 Aug; 25(8):1566-82. PubMed ID: 25050952
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 7. Linkage problem, distribution estimation, and Bayesian networks.
    Pelikan M; Goldberg DE; Cantú-Paz E
    Evol Comput; 2000; 8(3):311-40. PubMed ID: 11001554
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs.
    Bhowmick S; Chen TY; Halappanavar M
    J Parallel Distrib Comput; 2015 Feb; 76():132-144. PubMed ID: 25767331
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Multi-GPU implementation of a VMAT treatment plan optimization algorithm.
    Tian Z; Peng F; Folkerts M; Tan J; Jia X; Jiang SB
    Med Phys; 2015 Jun; 42(6):2841-52. PubMed ID: 26127037
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. Evaluation of a parallel implementation of the learning portion of the backward error propagation neural network: experiments in artifact identification.
    Sittig DF; Orr JA
    Proc Annu Symp Comput Appl Med Care; 1991; ():290-4. PubMed ID: 1807607
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Approximating the maximum weight clique using replicator dynamics.
    Bomze IR; Pelillo M; Stix V
    IEEE Trans Neural Netw; 2000; 11(6):1228-41. PubMed ID: 18249849
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Discontinuities in recurrent neural networks.
    Gavaldá R; Siegelmann HT
    Neural Comput; 1999 Apr; 11(3):715-46. PubMed ID: 10085427
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The maximum clique enumeration problem: algorithms, applications, and implementations.
    Eblen JD; Phillips CA; Rogers GL; Langston MA
    BMC Bioinformatics; 2012 Jun; 13 Suppl 10(Suppl 10):S5. PubMed ID: 22759429
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Exact parallel maximum clique algorithm for general and protein graphs.
    Depolli M; Konc J; Rozman K; Trobec R; Janežič D
    J Chem Inf Model; 2013 Sep; 53(9):2217-28. PubMed ID: 23965016
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Finite-element neural networks for solving differential equations.
    Ramuhalli P; Udpa L; Udpa SS
    IEEE Trans Neural Netw; 2005 Nov; 16(6):1381-92. PubMed ID: 16342482
    [TBL] [Abstract][Full Text] [Related]  

  • 18. FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization.
    Grossi G; Pedersini F
    Neural Netw; 2008 Aug; 21(6):872-9. PubMed ID: 18684590
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. A neural network model to minimize the connected dominating set for self-configuration of wireless sensor networks.
    He H; Zhu Z; Mäkinen E
    IEEE Trans Neural Netw; 2009 Jun; 20(6):973-82. PubMed ID: 19398401
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.