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 *

188 related articles for article (PubMed ID: 24808478)

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

  • 22. Random walks for image segmentation.
    Grady L
    IEEE Trans Pattern Anal Mach Intell; 2006 Nov; 28(11):1768-83. PubMed ID: 17063682
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Efficient quantum walk on a quantum processor.
    Qiang X; Loke T; Montanaro A; Aungskunsiri K; Zhou X; O'Brien JL; Wang JB; Matthews JCF
    Nat Commun; 2016 May; 7():11511. PubMed ID: 27146471
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A graph extension of the positional Burrows-Wheeler transform and its applications.
    Novak AM; Garrison E; Paten B
    Algorithms Mol Biol; 2017; 12():18. PubMed ID: 28702075
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Visual exploration of complex time-varying graphs.
    Kumar G; Garland M
    IEEE Trans Vis Comput Graph; 2006; 12(5):805-12. PubMed ID: 17080803
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Multi-Attributed Graph Matching With Multi-Layer Graph Structure and Multi-Layer Random Walks.
    Park HM; Yoon KJ
    IEEE Trans Image Process; 2018 May; 27(5):2314-2325. PubMed ID: 29470169
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity.
    Minello G; Rossi L; Torsello A
    Entropy (Basel); 2019 Mar; 21(3):. PubMed ID: 33267042
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Computing Reeb Graphs as a Union of Contour Trees.
    Doraiswamy H; Natarajan V
    IEEE Trans Vis Comput Graph; 2013 Feb; 19(2):249-62. PubMed ID: 22529327
    [TBL] [Abstract][Full Text] [Related]  

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

  • 30. Graph kernels for molecular structure-activity relationship analysis with support vector machines.
    Mahé P; Ueda N; Akutsu T; Perret JL; Vert JP
    J Chem Inf Model; 2005; 45(4):939-51. PubMed ID: 16045288
    [TBL] [Abstract][Full Text] [Related]  

  • 31. A Comprehensive Evaluation of Graph Kernels for Unattributed Graphs.
    Zhang Y; Wang L; Wang L
    Entropy (Basel); 2018 Dec; 20(12):. PubMed ID: 33266707
    [TBL] [Abstract][Full Text] [Related]  

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

  • 33. Random walks and chemical graph theory.
    Klein DJ; Palacios JL; Randić M; Trinajstić N
    J Chem Inf Comput Sci; 2004; 44(5):1521-5. PubMed ID: 15446809
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Including the Size of Regions in Image Segmentation by Region-Based Graph.
    Rezvanifar A; Khosravifard M
    IEEE Trans Image Process; 2014 Feb; 23(2):635-44. PubMed ID: 24216717
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Graph Matching Based on Stochastic Perturbation.
    Leng C; Xu W; Cheng I; Basu A
    IEEE Trans Image Process; 2015 Dec; 24(12):4862-75. PubMed ID: 26292343
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Maximal-entropy random walks in complex networks with limited information.
    Sinatra R; Gómez-Gardeñes J; Lambiotte R; Nicosia V; Latora V
    Phys Rev E Stat Nonlin Soft Matter Phys; 2011 Mar; 83(3 Pt 1):030103. PubMed ID: 21517435
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Fast Generation of Sparse Random Kernel Graphs.
    Hagberg A; Lemons N
    PLoS One; 2015; 10(9):e0135177. PubMed ID: 26356296
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Quantum Interference, Graphs, Walks, and Polynomials.
    Tsuji Y; Estrada E; Movassagh R; Hoffmann R
    Chem Rev; 2018 May; 118(10):4887-4911. PubMed ID: 29630345
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Generalizing Swendsen-Wang to sampling arbitrary posterior probabilities.
    Barbu A; Zhu SC
    IEEE Trans Pattern Anal Mach Intell; 2005 Aug; 27(8):1239-53. PubMed ID: 16119263
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Dynamic graph cuts for efficient inference in Markov Random Fields.
    Kohli P; Torr PH
    IEEE Trans Pattern Anal Mach Intell; 2007 Dec; 29(12):2079-88. PubMed ID: 17934219
    [TBL] [Abstract][Full Text] [Related]  

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