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 *

117 related articles for article (PubMed ID: 39145205)

  • 1. An optimization algorithm for maximum quasi-clique problem based on information feedback model.
    Liu S; Zhou J; Wang D; Zhang Z; Lei M
    PeerJ Comput Sci; 2024; 10():e2173. PubMed ID: 39145205
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 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. Iterated Clique Reductions in Vertex Weighted Coloring for Large Sparse Graphs.
    Fan Y; Zhang Z; Yu Q; Lai Y; Su K; Wang Y; Pan S; Latecki LJ
    Entropy (Basel); 2023 Sep; 25(10):. PubMed ID: 37895498
    [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. 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]  

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

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

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

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

  • 12. Geometric Deep Learning sub-network extraction for Maximum Clique Enumeration.
    Carchiolo V; Grassia M; Malgeri M; Mangioni G
    PLoS One; 2024; 19(1):e0296185. PubMed ID: 38227587
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Computing a maximum clique in geometric superclasses of disk graphs.
    Grelier N
    J Comb Optim; 2022; 44(4):3106-3135. PubMed ID: 36258784
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An exact algorithm to find a maximum weight clique in a weighted undirected graph.
    Rozman K; Ghysels A; Janežič D; Konc J
    Sci Rep; 2024 Apr; 14(1):9118. PubMed ID: 38643335
    [TBL] [Abstract][Full Text] [Related]  

  • 15. An annealed chaotic maximum neural network for bipartite subgraph problem.
    Wang J; Tang Z; Wang R
    Int J Neural Syst; 2004 Apr; 14(2):107-16. PubMed ID: 15112368
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Maximum common subgraph: some upper bound and lower bound results.
    Huang X; Lai J; Jennings SF
    BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S6. PubMed ID: 17217524
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Protein side-chain packing problem: a maximum edge-weight clique algorithmic approach.
    Dukka Bahadur KC; Tomita E; Suzuki J; Akutsu T
    J Bioinform Comput Biol; 2005 Feb; 3(1):103-26. PubMed ID: 15751115
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks.
    Li X; Chen X; Hu S; Xu J; Liu Z
    iScience; 2024 Feb; 27(2):108953. PubMed ID: 38333715
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Automatic Quasi-Clique Merger Algorithm - a Hierarchical Clustering Based on Subgraph-Density.
    Payne S; Fuller E; Spirou G; Zhang CQ
    Physica A; 2022 Jan; 585():. PubMed ID: 34737487
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.