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 *

181 related articles for article (PubMed ID: 32289946)

  • 21. Graph Simplification-Aided ADMM for Decentralized Composite Optimization.
    Wang B; Fang J; Duan H; Li H
    IEEE Trans Cybern; 2021 Oct; 51(10):5170-5183. PubMed ID: 31831456
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Entropy, Graph Homomorphisms, and Dissociation Sets.
    Wang Z; Tu J; Lang R
    Entropy (Basel); 2023 Jan; 25(1):. PubMed ID: 36673303
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Parallel Algorithms for Switching Edges in Heterogeneous Graphs.
    Bhuiyan H; Khan M; Chen J; Marathe M
    J Parallel Distrib Comput; 2017 Jun; 104():19-35. PubMed ID: 28757680
    [TBL] [Abstract][Full Text] [Related]  

  • 24. Martingales and the fixation probability of high-dimensional evolutionary graphs.
    Monk T
    J Theor Biol; 2018 Aug; 451():10-18. PubMed ID: 29727631
    [TBL] [Abstract][Full Text] [Related]  

  • 25. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

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

  • 27. Localization in random bipartite graphs: Numerical and empirical study.
    Slanina F
    Phys Rev E; 2017 May; 95(5-1):052149. PubMed ID: 28618645
    [TBL] [Abstract][Full Text] [Related]  

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

  • 29. Shannon Entropy of Ramsey Graphs with up to Six Vertices.
    Frenkel M; Shoval S; Bormashenko E
    Entropy (Basel); 2023 Oct; 25(10):. PubMed ID: 37895548
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. Random graphs with hidden color.
    Söderberg B
    Phys Rev E Stat Nonlin Soft Matter Phys; 2003 Jul; 68(1 Pt 2):015102. PubMed ID: 12935185
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Evolutionary dynamics on graphs.
    Lieberman E; Hauert C; Nowak MA
    Nature; 2005 Jan; 433(7023):312-6. PubMed ID: 15662424
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Impossibility result for Markov chain Monte Carlo sampling from microcanonical bipartite graph ensembles.
    Preti G; De Francisci Morales G; Riondato M
    Phys Rev E; 2024 May; 109(5):L053301. PubMed ID: 38907506
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. Sensitivity of directed networks to the addition and pruning of edges and vertices.
    Goltsev AV; Timár G; Mendes JFF
    Phys Rev E; 2017 Aug; 96(2-1):022317. PubMed ID: 28950620
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Fast construction of assembly trees for molecular graphs.
    Artemova S; Grudinin S; Redon S
    J Comput Chem; 2011 Jun; 32(8):1589-98. PubMed ID: 21328401
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Martingales and the characteristic functions of absorption time on bipartite graphs.
    Monk T; van Schaik A
    R Soc Open Sci; 2021 Oct; 8(10):210657. PubMed ID: 34703620
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Analytical calculation of average fixation time in evolutionary graphs.
    Askari M; Samani KA
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Oct; 92(4):042707. PubMed ID: 26565272
    [TBL] [Abstract][Full Text] [Related]  

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

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

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