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 *

303 related articles for article (PubMed ID: 32025196)

  • 41. On
    Inayah N; Susanto F; Semaničová-Feňovčíková A
    Heliyon; 2021 Oct; 7(10):e08203. PubMed ID: 34712860
    [TBL] [Abstract][Full Text] [Related]  

  • 42. The partition dimension of the vertex amalgamation of some cycles.
    Hasmawati ; Hinding N; Nurwahyu B; Syukur Daming A; Kamal Amir A
    Heliyon; 2022 Jun; 8(6):e09596. PubMed ID: 35711982
    [TBL] [Abstract][Full Text] [Related]  

  • 43. Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
    Chakraborty S; Novo L; Ambainis A; Omar Y
    Phys Rev Lett; 2016 Mar; 116(10):100501. PubMed ID: 27015464
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Robustness of random graphs based on graph spectra.
    Wu J; Barahona M; Tan YJ; Deng HZ
    Chaos; 2012 Dec; 22(4):043101. PubMed ID: 23278036
    [TBL] [Abstract][Full Text] [Related]  

  • 45. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.
    Jain S; Saju S; Petingi L; Schlick T
    Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Sequence Alignment on Directed Graphs.
    Kavya VNS; Tayal K; Srinivasan R; Sivadasan N
    J Comput Biol; 2019 Jan; 26(1):53-67. PubMed ID: 30204489
    [TBL] [Abstract][Full Text] [Related]  

  • 47. NUMERICAL INTEGRATION ON GRAPHS: WHERE TO SAMPLE AND HOW TO WEIGH.
    Linderman GC; Steinerberger S
    Math Comput; 2020; 89(324):1933-1952. PubMed ID: 33927452
    [TBL] [Abstract][Full Text] [Related]  

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

  • 49. Seeing the results of a mutation with a vertex weighted hierarchical graph.
    Knisley DJ; Knisley JR
    BMC Proc; 2014; 8(Suppl 2 Proceedings of the 3rd Annual Symposium on Biologica):S7. PubMed ID: 25237394
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Exactly solvable model of a coalescing random graph.
    Lushnikov AA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Feb; 91(2):022119. PubMed ID: 25768470
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 53. Approximating the correction of weighted and unweighted orthology and paralogy relations.
    Dondi R; Lafond M; El-Mabrouk N
    Algorithms Mol Biol; 2017; 12():4. PubMed ID: 28293276
    [TBL] [Abstract][Full Text] [Related]  

  • 54. Hosoya Polynomial for Subdivided Caterpillar Graphs.
    Numan M; Nawaz A; Aslam A; Butt SI
    Comb Chem High Throughput Screen; 2022; 25(3):554-559. PubMed ID: 33308123
    [TBL] [Abstract][Full Text] [Related]  

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

  • 56. The linear framework: using graph theory to reveal the algebra and thermodynamics of biomolecular systems.
    Nam KM; Martinez-Corral R; Gunawardena J
    Interface Focus; 2022 Aug; 12(4):20220013. PubMed ID: 35860006
    [TBL] [Abstract][Full Text] [Related]  

  • 57. Optimal Quantum Spatial Search on Random Temporal Networks.
    Chakraborty S; Novo L; Di Giorgio S; Omar Y
    Phys Rev Lett; 2017 Dec; 119(22):220503. PubMed ID: 29286791
    [TBL] [Abstract][Full Text] [Related]  

  • 58. Long paths and connectivity in 1-independent random graphs.
    Day AN; Falgas-Ravry V; Hancock R
    Random Struct Algorithms; 2020 Dec; 57(4):1007-1049. PubMed ID: 33328712
    [TBL] [Abstract][Full Text] [Related]  

  • 59. Clustering algorithm with strength of connectedness for m-polar fuzzy network models.
    Akram M; Siddique S; Alharbi MG
    Math Biosci Eng; 2022 Jan; 19(1):420-455. PubMed ID: 34902998
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Live-wires using path-graphs.
    König S; Hesser J
    Methods Inf Med; 2004; 43(4):371-5. PubMed ID: 15472749
    [TBL] [Abstract][Full Text] [Related]  

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