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 *

344 related articles for article (PubMed ID: 32025196)

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

  • 22. The average distances in random graphs with given expected degrees.
    Chung F; Lu L
    Proc Natl Acad Sci U S A; 2002 Dec; 99(25):15879-82. PubMed ID: 12466502
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Vertex Deletion into Bipartite Permutation Graphs.
    Bożyk Ł; Derbisz J; Krawczyk T; Novotná J; Okrasa K
    Algorithmica; 2022; 84(8):2271-2291. PubMed ID: 35880199
    [TBL] [Abstract][Full Text] [Related]  

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

  • 25. Are randomly grown graphs really random?
    Callaway DS; Hopcroft JE; Kleinberg JM; Newman ME; Strogatz SH
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Oct; 64(4 Pt 1):041902. PubMed ID: 11690047
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Computing the partition dimension of certain families of Toeplitz graph.
    Luo R; Khalil A; Ahmad A; Azeem M; Ibragimov G; Nadeem MF
    Front Comput Neurosci; 2022; 16():959105. PubMed ID: 36313814
    [TBL] [Abstract][Full Text] [Related]  

  • 27. On the Extremal Wiener Polarity Index of Hückel Graphs.
    Wang H
    Comput Math Methods Med; 2016; 2016():3873597. PubMed ID: 27247613
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. The differential on operator S(Γ).
    Castro J; Basilio LA; Reyna G; Rosario O
    Math Biosci Eng; 2023 May; 20(7):11568-11584. PubMed ID: 37501409
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 33. The dominant metric dimension of graphs.
    Susilowati L; Sa'adah I; Fauziyyah RZ; Erfanian A; Slamin
    Heliyon; 2020 Mar; 6(3):e03633. PubMed ID: 32226834
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs.
    Liu C; Song Y
    J Comb Optim; 2010 Apr; 20(2):1-15. PubMed ID: 23874144
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

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

  • 37. Rainbow connections of bioriented graphs.
    Wang L; Liu S; Jiang H
    Heliyon; 2024 May; 10(10):e31426. PubMed ID: 38831833
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Discriminative and Efficient Label Propagation on Complementary Graphs for Multi-Object Tracking.
    K C AK; Jacques L; De Vleeschouwer C
    IEEE Trans Pattern Anal Mach Intell; 2017 Jan; 39(1):61-74. PubMed ID: 26915115
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Edge Mostar Indices of Cacti Graph With Fixed Cycles.
    Yasmeen F; Akhter S; Ali K; Rizvi STR
    Front Chem; 2021; 9():693885. PubMed ID: 34307297
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Learning Hidden Graphs From Samples.
    Abniki A; Beigy H
    IEEE Trans Pattern Anal Mach Intell; 2023 Oct; 45(10):11993-12003. PubMed ID: 37285255
    [TBL] [Abstract][Full Text] [Related]  

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