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 *

114 related articles for article (PubMed ID: 33707803)

  • 41. Factorization and pseudofactorization of weighted graphs.
    Sheridan K; Berleant J; Bathe M; Condon A; Williams VV
    Discrete Appl Math; 2023 Oct; 337():81-105. PubMed ID: 37213330
    [TBL] [Abstract][Full Text] [Related]  

  • 42. Network orientation via shortest paths.
    Silverbush D; Sharan R
    Bioinformatics; 2014 May; 30(10):1449-55. PubMed ID: 24470573
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Relative timing information and orthology in evolutionary scenarios.
    Schaller D; Hartmann T; Lafond M; Stadler PF; Wieseke N; Hellmuth M
    Algorithms Mol Biol; 2023 Nov; 18(1):16. PubMed ID: 37940998
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Splitting Vertices in 2-Layer Graph Drawings.
    Ahmed R; Angelini P; Bekos MA; Battista GD; Kaufmann M; Kindermann P; Kobourov S; Nollenburg M; Symvonis A; Villedieu A; Wallinger M
    IEEE Comput Graph Appl; 2023; 43(3):24-35. PubMed ID: 37023163
    [TBL] [Abstract][Full Text] [Related]  

  • 45. Implementing Graph-Theoretic Feature Selection by Quantum Approximate Optimization Algorithm.
    Li Y; Zhou RG; Xu R; Luo J; Hu W; Fan P
    IEEE Trans Neural Netw Learn Syst; 2024 Feb; 35(2):2364-2377. PubMed ID: 35862330
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem.
    Pourhassan M; Shi F; Neumann F
    Evol Comput; 2019; 27(4):559-575. PubMed ID: 31012735
    [TBL] [Abstract][Full Text] [Related]  

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

  • 48. Stable Matchings with Covering Constraints: A Complete Computational Trichotomy.
    Mnich M; Schlotter I
    Algorithmica; 2020; 82(5):1136-1188. PubMed ID: 32214574
    [TBL] [Abstract][Full Text] [Related]  

  • 49. Improved algorithms for enumerating tree-like chemical graphs with given path frequency.
    Ishida Y; Zhao L; Nagamochi H; Akutsu T
    Genome Inform; 2008; 21():53-64. PubMed ID: 19425147
    [TBL] [Abstract][Full Text] [Related]  

  • 50. On Certain Topological Indices of Three-Layered Single-Walled Titania Nanosheets.
    Arockiaraj M; Liu JB; Arulperumjothi M; Prabhu S
    Comb Chem High Throughput Screen; 2022; 25(3):483-495. PubMed ID: 33109055
    [TBL] [Abstract][Full Text] [Related]  

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

  • 52. The approximability of shortest path-based graph orientations of protein-protein interaction networks.
    Blokh D; Segev D; Sharan R
    J Comput Biol; 2013 Dec; 20(12):945-57. PubMed ID: 24073924
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.
    Tomescu AI; Gagie T; Popa A; Rizzi R; Kuosmanen A; Mäkinen V
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1345-54. PubMed ID: 26671806
    [TBL] [Abstract][Full Text] [Related]  

  • 54. On the nullity of a graph with cut-points.
    Gong SC; Xu GH
    Linear Algebra Appl; 2012 Jan; 436(1):135-142. PubMed ID: 22215910
    [TBL] [Abstract][Full Text] [Related]  

  • 55. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 56. An iterated tabu search approach for the clique partitioning problem.
    Palubeckis G; Ostreika A; Tomkevičius A
    ScientificWorldJournal; 2014; 2014():353101. PubMed ID: 24737968
    [TBL] [Abstract][Full Text] [Related]  

  • 57. The reflexive edge strength on some almost regular graphs.
    Agustin IH; Dafik ; Imam Utoyo M; Slamin ; Venkatachalam M
    Heliyon; 2021 May; 7(5):e06991. PubMed ID: 34027187
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
    Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Counting Linear Extensions: Parameterizations by Treewidth.
    Eiben E; Ganian R; Kangas K; Ordyniak S
    Algorithmica; 2019; 81(4):1657-1683. PubMed ID: 31007326
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Path-based knowledge reasoning with textual semantic information for medical knowledge graph completion.
    Lan Y; He S; Liu K; Zeng X; Liu S; Zhao J
    BMC Med Inform Decis Mak; 2021 Nov; 21(Suppl 9):335. PubMed ID: 34844576
    [TBL] [Abstract][Full Text] [Related]  

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