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 *

95 related articles for article (PubMed ID: 31212453)

  • 1. Graph comparison via the nonbacktracking spectrum.
    Mellor A; Grusovin A
    Phys Rev E; 2019 May; 99(5-1):052309. PubMed ID: 31212453
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Nonbacktracking operator for the Ising model and its applications in systems with multiple states.
    Zhang P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2015 Apr; 91(4):042120. PubMed ID: 25974451
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Nonbacktracking expansion of finite graphs.
    Timár G; da Costa RA; Dorogovtsev SN; Mendes JFF
    Phys Rev E; 2017 Apr; 95(4-1):042322. PubMed ID: 28505741
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Network comparison and the within-ensemble graph distance.
    Hartle H; Klein B; McCabe S; Daniels A; St-Onge G; Murphy C; Hébert-Dufresne L
    Proc Math Phys Eng Sci; 2020 Nov; 476(2243):20190744. PubMed ID: 33363435
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Components in time-varying graphs.
    Nicosia V; Tang J; Musolesi M; Russo G; Mascolo C; Latora V
    Chaos; 2012 Jun; 22(2):023101. PubMed ID: 22757508
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Graph 'texture' features as novel metrics that can summarize complex biological graphs.
    Barker-Clarke R; Weaver DT; Scott JG
    Phys Med Biol; 2023 Aug; 68(17):. PubMed ID: 37385267
    [No Abstract]   [Full Text] [Related]  

  • 7. Spectral redemption in clustering sparse networks.
    Krzakala F; Moore C; Mossel E; Neeman J; Sly A; Zdeborová L; Zhang P
    Proc Natl Acad Sci U S A; 2013 Dec; 110(52):20935-40. PubMed ID: 24277835
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Graphlet correlation distance to compare small graphs.
    Roux J; Bez N; Rochet P; Joo R; Mahévas S
    PLoS One; 2023; 18(2):e0281646. PubMed ID: 36791120
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (TO
    Day MC; Hawthorne FC; Rostami A
    Acta Crystallogr A Found Adv; 2024 May; 80(Pt 3):258-281. PubMed ID: 38683645
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Metric learning with spectral graph convolutions on brain connectivity networks.
    Ktena SI; Parisot S; Ferrante E; Rajchl M; Lee M; Glocker B; Rueckert D
    Neuroimage; 2018 Apr; 169():431-442. PubMed ID: 29278772
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Metrics for graph comparison: A practitioner's guide.
    Wills P; Meyer FG
    PLoS One; 2020; 15(2):e0228728. PubMed ID: 32050004
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Closed trail distance in a biconnected graph.
    Snasel V; Drazdilova P; Platos J
    PLoS One; 2018; 13(8):e0202181. PubMed ID: 30169516
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Discriminative graph embedding for label propagation.
    Nguyen CH; Mamitsuka H
    IEEE Trans Neural Netw; 2011 Sep; 22(9):1395-405. PubMed ID: 21788187
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Multi-way association extraction and visualization from biological text documents using hyper-graphs: applications to genetic association studies for diseases.
    Mukhopadhyay S; Palakal M; Maddu K
    Artif Intell Med; 2010 Jul; 49(3):145-54. PubMed ID: 20382004
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Hybrid graphs as a framework for the small-world effect.
    Lehmann KA; Post HD; Kaufmann M
    Phys Rev E Stat Nonlin Soft Matter Phys; 2006 May; 73(5 Pt 2):056108. PubMed ID: 16802999
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Learning Hyperedge Replacement Grammars for Graph Generation.
    Aguinaga S; Chiang D; Weninger T
    IEEE Trans Pattern Anal Mach Intell; 2019 Mar; 41(3):625-638. PubMed ID: 29994579
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. Topic Model for Graph Mining.
    Xuan J; Lu J; Zhang G; Luo X
    IEEE Trans Cybern; 2015 Dec; 45(12):2792-803. PubMed ID: 25616091
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Same Stats, Different Graphs: Exploring the Space of Graphs in Terms of Graph Properties.
    Chen H; Soni U; Lu Y; Huroyan V; Maciejewski R; Kobourov S
    IEEE Trans Vis Comput Graph; 2021 Mar; 27(3):2056-2072. PubMed ID: 31603821
    [TBL] [Abstract][Full Text] [Related]  

  • 20. A binary linear programming formulation of the graph edit distance.
    Justice D; Hero A
    IEEE Trans Pattern Anal Mach Intell; 2006 Aug; 28(8):1200-14. PubMed ID: 16886857
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 5.