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)

  • 21. Finding a Maximum Common Subgraph from Molecular Structural Formulas through the Maximum Clique Approach Combined with the Ising Model.
    Okamoto Y
    ACS Omega; 2020 Jun; 5(22):13064-13068. PubMed ID: 32548491
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Improving Metaheuristic Algorithms With Information Feedback Models.
    Wang GG; Tan Y
    IEEE Trans Cybern; 2019 Feb; 49(2):542-555. PubMed ID: 29990274
    [TBL] [Abstract][Full Text] [Related]  

  • 23. A parallel improvement algorithm for the bipartite subgraph problem.
    Lee KC; Funabiki N; Takefuji Y
    IEEE Trans Neural Netw; 1992; 3(1):139-45. PubMed ID: 18276415
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Point matching under non-uniform distortions and protein side chain packing based on an efficient maximum clique algorithm.
    Dukka BK; Akutsu T; Tomita E; Seki T; Fujiyama A
    Genome Inform; 2002; 13():143-52. PubMed ID: 14571383
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 27. k-Partite cliques of protein interactions: A novel subgraph topology for functional coherence analysis on PPI networks.
    Liu Q; Chen YP; Li J
    J Theor Biol; 2014 Jan; 340():146-54. PubMed ID: 24056214
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Dynamic thresholding search for the feedback vertex set problem.
    Sun W; Hao JK; Wu Z; Li W; Wu Q
    PeerJ Comput Sci; 2023; 9():e1245. PubMed ID: 37346631
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Using Statistical Measures and Machine Learning for Graph Reduction to Solve Maximum Weight Clique Problems.
    Sun Y; Li X; Ernst A
    IEEE Trans Pattern Anal Mach Intell; 2021 May; 43(5):1746-1760. PubMed ID: 31751227
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A Graph-Neural-Network-Powered Solver Framework for Graph Optimization Problems.
    Zhang C; Gao Y; Nastos J
    IEEE Trans Neural Netw Learn Syst; 2024 Sep; 35(9):11746-11760. PubMed ID: 38771685
    [TBL] [Abstract][Full Text] [Related]  

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

  • 32. A clique-based method using dynamic programming for computing edit distance between unordered trees.
    Mori T; Tamura T; Fukagawa D; Takasu A; Tomita E; Akutsu T
    J Comput Biol; 2012 Oct; 19(10):1089-104. PubMed ID: 23057820
    [TBL] [Abstract][Full Text] [Related]  

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

  • 34. A deep reinforcement learning algorithm for the rectangular strip packing problem.
    Fang J; Rao Y; Shi M
    PLoS One; 2023; 18(3):e0282598. PubMed ID: 36928505
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Scaffold hopping using clique detection applied to reduced graphs.
    Barker EJ; Buttar D; Cosgrove DA; Gardiner EJ; Kitts P; Willett P; Gillet VJ
    J Chem Inf Model; 2006; 46(2):503-11. PubMed ID: 16562978
    [TBL] [Abstract][Full Text] [Related]  

  • 36. WMAXC: a weighted maximum clique method for identifying condition-specific sub-network.
    Amgalan B; Lee H
    PLoS One; 2014; 9(8):e104993. PubMed ID: 25148538
    [TBL] [Abstract][Full Text] [Related]  

  • 37. A differentiable approach to the maximum independent set problem using dataless neural networks.
    Alkhouri IR; Atia GK; Velasquez A
    Neural Netw; 2022 Nov; 155():168-176. PubMed ID: 36057182
    [TBL] [Abstract][Full Text] [Related]  

  • 38. A modified version of the ABC algorithm and evaluation of its performance.
    Chaudhary KC
    Heliyon; 2023 May; 9(5):e16086. PubMed ID: 37223708
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Phase unwrapping via graph cuts.
    Bioucas-Dias JM; Valadão G
    IEEE Trans Image Process; 2007 Mar; 16(3):698-709. PubMed ID: 17357730
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Maximising the size of non-redundant protein datasets using graph theory.
    Bull SC; Muldoon MR; Doig AJ
    PLoS One; 2013; 8(2):e55484. PubMed ID: 23393584
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 6.