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 *

138 related articles for article (PubMed ID: 18249849)

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

  • 2. Payoff-monotonic game dynamics and the maximum clique problem.
    Pelillo M; Torsello A
    Neural Comput; 2006 May; 18(5):1215-58. PubMed ID: 16595063
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Replicator equations, maximal cliques, and graph isomorphism.
    Pelillo M
    Neural Comput; 1999 Nov; 11(8):1933-55. PubMed ID: 10578039
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Approximating maximum clique with a Hopfield network.
    Jagota A
    IEEE Trans Neural Netw; 1995; 6(3):724-35. PubMed ID: 18263357
    [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. 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]  

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

  • 8. Clique percolation in random graphs.
    Li M; Deng Y; Wang BH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Oct; 92(4):042116. PubMed ID: 26565177
    [TBL] [Abstract][Full Text] [Related]  

  • 9. A note on computational approaches for the antibandwidth problem.
    Sinnl M
    Cent Eur J Oper Res; 2021; 29(3):1057-1077. PubMed ID: 34776784
    [TBL] [Abstract][Full Text] [Related]  

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

  • 11. Hard optimization problems have soft edges.
    Marino R; Kirkpatrick S
    Sci Rep; 2023 Mar; 13(1):3671. PubMed ID: 36871049
    [TBL] [Abstract][Full Text] [Related]  

  • 12. A Hybrid Evolutionary Algorithm for the Clique Partitioning Problem.
    Lu Z; Zhou Y; Hao JK
    IEEE Trans Cybern; 2022 Sep; 52(9):9391-9403. PubMed ID: 33635807
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. Lumping evolutionary game dynamics on networks.
    Iacobelli G; Madeo D; Mocenni C
    J Theor Biol; 2016 Oct; 407():328-338. PubMed ID: 27475842
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Sequential algorithm for fast clique percolation.
    Kumpula JM; Kivelä M; Kaski K; Saramäki J
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Aug; 78(2 Pt 2):026109. PubMed ID: 18850899
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Common Visual Pattern Discovery via Directed Graph.
    Wang C; Ma KK
    IEEE Trans Image Process; 2014 Mar; 23(3):1408-18. PubMed ID: 24723536
    [TBL] [Abstract][Full Text] [Related]  

  • 17. A flexible annealing chaotic neural network to maximum clique problem.
    Yang G; Tang Z; Zhang Z; Zhu Y
    Int J Neural Syst; 2007 Jun; 17(3):183-92. PubMed ID: 17640099
    [TBL] [Abstract][Full Text] [Related]  

  • 18. An improved transiently chaotic neural network for the maximum independent set problem.
    Xu X; Tang Z; Wang J
    Int J Neural Syst; 2004 Dec; 14(6):381-92. PubMed ID: 15714605
    [TBL] [Abstract][Full Text] [Related]  

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

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

    [Next]    [New Search]
    of 7.