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 *

122 related articles for article (PubMed ID: 35880199)

  • 41. Partition Independent Set and Reduction-Based Approach for Partition Coloring Problem.
    Zhu E; Jiang F; Liu C; Xu J
    IEEE Trans Cybern; 2022 Jun; 52(6):4960-4969. PubMed ID: 33108304
    [TBL] [Abstract][Full Text] [Related]  

  • 42. Solving Problems on Graphs of High Rank-Width.
    Eiben E; Ganian R; Szeider S
    Algorithmica; 2018; 80(2):742-771. PubMed ID: 31997848
    [TBL] [Abstract][Full Text] [Related]  

  • 43. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Clustering analysis of the ground-state structure of the vertex-cover problem.
    Barthel W; Hartmann AK
    Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Dec; 70(6 Pt 2):066120. PubMed ID: 15697447
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Anchor Graph Network for Incomplete Multiview Clustering.
    Fu Y; Li Y; Huang Q; Cui J; Wen J
    IEEE Trans Neural Netw Learn Syst; 2024 Jan; PP():. PubMed ID: 38215314
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Flip Distances Between Graph Orientations.
    Aichholzer O; Cardinal J; Huynh T; Knauer K; Mütze T; Steiner R; Vogtenhuber B
    Algorithmica; 2021; 83(1):116-143. PubMed ID: 33583986
    [TBL] [Abstract][Full Text] [Related]  

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

  • 48. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 49. Indirect identification of horizontal gene transfer.
    Schaller D; Lafond M; Stadler PF; Wieseke N; Hellmuth M
    J Math Biol; 2021 Jul; 83(1):10. PubMed ID: 34218334
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Further results on the radio number for some construction of the path, complete, and complete bipartite graphs.
    Mari B; Jeyaraj RS
    Heliyon; 2024 Jul; 10(14):e34434. PubMed ID: 39130467
    [TBL] [Abstract][Full Text] [Related]  

  • 51. Sitting Closer to Friends than Enemies, Revisited.
    Cygan M; Pilipczuk M; Pilipczuk M; Wojtaszczyk JO
    Theory Comput Syst; 2015; 56(2):394-405. PubMed ID: 26300686
    [TBL] [Abstract][Full Text] [Related]  

  • 52. Characterization of 2-Path Product Signed Graphs with Its Properties.
    Sinha D; Sharma D
    Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Genus Ranges of 4-Regular Rigid Vertex Graphs.
    Buck D; Dolzhenko E; Jonoska N; Saito M; Valencia K
    Electron J Comb; 2015; 22(3):. PubMed ID: 27807395
    [TBL] [Abstract][Full Text] [Related]  

  • 54. New algorithms for maximum disjoint paths based on tree-likeness.
    Fleszar K; Mnich M; Spoerhase J
    Math Program; 2018; 171(1):433-461. PubMed ID: 30956356
    [TBL] [Abstract][Full Text] [Related]  

  • 55. Permute Me Softly: Learning Soft Permutations for Graph Representations.
    Nikolentzos G; Dasoulas G; Vazirgiannis M
    IEEE Trans Pattern Anal Mach Intell; 2023 Apr; 45(4):5087-5098. PubMed ID: 35793300
    [TBL] [Abstract][Full Text] [Related]  

  • 56. Non-Weyl Microwave Graphs.
    Ławniczak M; Lipovský J; Sirko L
    Phys Rev Lett; 2019 Apr; 122(14):140503. PubMed ID: 31050459
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Linear Time Vertex Partitioning on Massive Graphs.
    Mell P; Harang R; Gueye A
    Int J Comput Sci (Rabat); 2016; 5(1):1-11. PubMed ID: 27336059
    [TBL] [Abstract][Full Text] [Related]  

  • 58. A heuristic method for solving the Steiner tree problem in graphs using network centralities.
    Fujita M; Shimada Y; Kimura T; Ikeguchi T
    PLoS One; 2024; 19(6):e0303764. PubMed ID: 38843249
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Graph characterization via Ihara coefficients.
    Ren P; Wilson RC; Hancock ER
    IEEE Trans Neural Netw; 2011 Feb; 22(2):233-45. PubMed ID: 21118772
    [TBL] [Abstract][Full Text] [Related]  

  • 60. DHPV: a distributed algorithm for large-scale graph partitioning.
    Adoni WYH; Nahhal T; Krichen M; El Byed A; Assayad I
    J Big Data; 2020; 7(1):76. PubMed ID: 32953386
    [TBL] [Abstract][Full Text] [Related]  

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