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)

  • 21. Torus Pairwise Disjoint-Path Routing.
    Bossard A; Kaneko K
    Sensors (Basel); 2018 Nov; 18(11):. PubMed ID: 30428614
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Fixed-parameter tractability of the maximum agreement supertree problem.
    Guillemot S; Berry V
    IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(2):342-53. PubMed ID: 20431153
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Characterizing compatibility and agreement of unrooted trees via cuts in graphs.
    Vakati S; Fernández-Baca D
    Algorithms Mol Biol; 2014; 9():13. PubMed ID: 24742332
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A new fast algorithm for solving the minimum spanning tree problem based on DNA molecules computation.
    Wang Z; Huang D; Meng H; Tang C
    Biosystems; 2013 Oct; 114(1):1-7. PubMed ID: 23871964
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Exact approaches for scaffolding.
    Weller M; Chateau A; Giroudeau R
    BMC Bioinformatics; 2015; 16 Suppl 14(Suppl 14):S2. PubMed ID: 26451725
    [TBL] [Abstract][Full Text] [Related]  

  • 26. On Hamiltonian Decomposition Problem of 3-Arc Graphs.
    Xu G; Sun Q; Liang Z
    Comput Intell Neurosci; 2022; 2022():5837405. PubMed ID: 35528366
    [TBL] [Abstract][Full Text] [Related]  

  • 27. The Steiner cycle and path cover problem on interval graphs.
    Ćustić A; Lendl S
    J Comb Optim; 2022; 43(1):226-234. PubMed ID: 35125930
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Connectivity of Triangulation Flip Graphs in the Plane.
    Wagner U; Welzl E
    Discrete Comput Geom; 2022; 68(4):1227-1284. PubMed ID: 36466128
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Total Irregularity Strengths of an Arbitrary Disjoint Union of (3,6)- Fullerenes.
    Shabbir A; Nadeem MF; Ovais A; Ashraf F; Nasir S
    Comb Chem High Throughput Screen; 2022; 25(3):500-509. PubMed ID: 33297913
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Computing nearest neighbour interchange distances between ranked phylogenetic trees.
    Collienne L; Gavryushkin A
    J Math Biol; 2021 Jan; 82(1-2):8. PubMed ID: 33492606
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Faster Cut Sparsification of Weighted Graphs.
    Forster S; de Vos T
    Algorithmica; 2023; 85(4):929-964. PubMed ID: 37008076
    [TBL] [Abstract][Full Text] [Related]  

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

  • 33. Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number.
    Misra P; Saurabh S; Sharma R; Zehavi M
    Algorithmica; 2023; 85(7):2065-2086. PubMed ID: 37362859
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. Exactly computing the parsimony scores on phylogenetic networks using dynamic programming.
    Kannan L; Wheeler WC
    J Comput Biol; 2014 Apr; 21(4):303-19. PubMed ID: 24559134
    [TBL] [Abstract][Full Text] [Related]  

  • 36. On the VC-Dimension of Unique Round-Trip Shortest Path Systems.
    Zhu CJ; Lam KY; Yin Ng JK; Bi J
    Inf Process Lett; 2019 May; 145():1-5. PubMed ID: 31741499
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Reoptimization of parameterized problems.
    Böckenhauer HJ; Burjons E; Raszyk M; Rossmanith P
    Acta Inform; 2022; 59(4):427-450. PubMed ID: 36045930
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
    Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
    Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Graph Theoretical Analysis Reveals: Women's Brains Are Better Connected than Men's.
    Szalkai B; Varga B; Grolmusz V
    PLoS One; 2015; 10(7):e0130045. PubMed ID: 26132764
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

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