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 *

113 related articles for article (PubMed ID: 22267873)

  • 1. Context-free pairs of groups II - Cuts, tree sets, and random walks.
    Woess W
    Discrete Math; 2012 Jan; 312(1):157-173. PubMed ID: 22267873
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Context-free pairs of groups I: Context-free pairs and graphs.
    Ceccherini-Silberstein T; Woess W
    Eur J Comb; 2012 Oct; 33(7):1449-1466. PubMed ID: 27087724
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Context-Dependent Random Walk Graph Kernels and Tree Pattern Graph Matching Kernels with Applications to Action Recognition.
    Hu W; Wu B; Wang P; Yuan C; Li Y; Maybank S
    IEEE Trans Image Process; 2018 Jun; ():. PubMed ID: 29994476
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A Quantum-Inspired Similarity Measure for the Analysis of Complete Weighted Graphs.
    Bai L; Rossi L; Cui L; Cheng J; Hancock ER
    IEEE Trans Cybern; 2020 Mar; 50(3):1264-1277. PubMed ID: 31295131
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Spectral and dynamical properties in classes of sparse networks with mesoscopic inhomogeneities.
    Mitrović M; Tadić B
    Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Aug; 80(2 Pt 2):026123. PubMed ID: 19792216
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Infinite Ergodic Walks in Finite Connected Undirected Graphs.
    Volchenkov D
    Entropy (Basel); 2021 Feb; 23(2):. PubMed ID: 33567624
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Return probabilities and hitting times of random walks on sparse Erdös-Rényi graphs.
    Martin OC; Sulc P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Mar; 81(3 Pt 1):031111. PubMed ID: 20365701
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Self-adjoint and Markovian extensions of infinite quantum graphs.
    Kostenko A; Mugnolo D; Nicolussi N
    J Lond Math Soc; 2022 Mar; 105(2):1262-1313. PubMed ID: 35912286
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. A decomposition theory for phylogenetic networks and incompatible characters.
    Gusfield D; Bansal V; Bafna V; Song YS
    J Comput Biol; 2007 Dec; 14(10):1247-72. PubMed ID: 18047426
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents.
    Draief M; Ganesh A
    Discret Event Dyn Syst; 2011; 21(1):41-61. PubMed ID: 32214674
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Analyzing and synthesizing phylogenies using tree alignment graphs.
    Smith SA; Brown JW; Hinchliff CE
    PLoS Comput Biol; 2013; 9(9):e1003223. PubMed ID: 24086118
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Graph limits of random graphs from a subset of connected k-trees.
    Drmota M; Jin EY; Stufler B
    Random Struct Algorithms; 2019 Aug; 55(1):125-152. PubMed ID: 31423073
    [TBL] [Abstract][Full Text] [Related]  

  • 15. The Random Plots Graph Generation Model for Studying Systems with Unknown Connection Structures.
    Ivanko E; Chernoskutov M
    Entropy (Basel); 2022 Feb; 24(2):. PubMed ID: 35205591
    [TBL] [Abstract][Full Text] [Related]  

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

  • 17. Mean first-passage time for random walks in general graphs with a deep trap.
    Lin Y; Julaiti A; Zhang Z
    J Chem Phys; 2012 Sep; 137(12):124104. PubMed ID: 23020321
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Delocalization-localization dynamical phase transition of random walks on graphs.
    Carugno G; Vivo P; Coghi F
    Phys Rev E; 2023 Feb; 107(2-1):024126. PubMed ID: 36932599
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees.
    Tierny J; Gyulassy A; Simon E; Pascucci V
    IEEE Trans Vis Comput Graph; 2009; 15(6):1177-84. PubMed ID: 19834187
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The combinatorics of discrete time-trees: theory and open problems.
    Gavryushkin A; Whidden C; Matsen FA
    J Math Biol; 2018 Apr; 76(5):1101-1121. PubMed ID: 28756523
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.