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 *

157 related articles for article (PubMed ID: 33567624)

  • 21. Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks.
    Zhang Z; Sheng Y; Hu Z; Chen G
    Chaos; 2012 Dec; 22(4):043129. PubMed ID: 23278064
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Finite-size effects in canonical and grand-canonical quantum Monte Carlo simulations for fermions.
    Wang Z; Assaad FF; Parisen Toldin F
    Phys Rev E; 2017 Oct; 96(4-1):042131. PubMed ID: 29347588
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Stochastic Compartment Model with Mortality and Its Application to Epidemic Spreading in Complex Networks.
    Granger T; Michelitsch TM; Bestehorn M; Riascos AP; Collet BA
    Entropy (Basel); 2024 Apr; 26(5):. PubMed ID: 38785610
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 27. On walks in molecular graphs.
    Gutman I; Rücker C; Rücker G
    J Chem Inf Comput Sci; 2001; 41(3):739-45. PubMed ID: 11410054
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Isolation and Connectivity in Random Geometric Graphs with Self-similar Intensity Measures.
    Dettmann CP
    J Stat Phys; 2018; 172(3):679-700. PubMed ID: 30996473
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Greedy connectivity of geographically embedded graphs.
    Sun J; ben-Avraham D
    Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Jul; 82(1 Pt 2):016109. PubMed ID: 20866691
    [TBL] [Abstract][Full Text] [Related]  

  • 30. Quantum algorithm for de novo DNA sequence assembly based on quantum walks on graphs.
    Varsamis GD; Karafyllidis IG; Gilkes KM; Arranz U; Martin-Cuevas R; Calleja G; Wong J; Jessen HC; Dimitrakis P; Kolovos P; Sandaltzopoulos R
    Biosystems; 2023 Nov; 233():105037. PubMed ID: 37734700
    [TBL] [Abstract][Full Text] [Related]  

  • 31. An R-Convolution Graph Kernel Based on Fast Discrete-Time Quantum Walk.
    Zhang Y; Wang L; Wilson RC; Liu K
    IEEE Trans Neural Netw Learn Syst; 2022 Jan; 33(1):292-303. PubMed ID: 33064655
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Implementing graph-theoretic quantum algorithms on a silicon photonic quantum walk processor.
    Qiang X; Wang Y; Xue S; Ge R; Chen L; Liu Y; Huang A; Fu X; Xu P; Yi T; Xu F; Deng M; Wang JB; Meinecke JDA; Matthews JCF; Cai X; Yang X; Wu J
    Sci Adv; 2021 Feb; 7(9):. PubMed ID: 33637521
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Long-range navigation on complex networks using Lévy random walks.
    Riascos AP; Mateos JL
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Nov; 86(5 Pt 2):056110. PubMed ID: 23214846
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Generating symmetric graphs.
    Klickstein I; Sorrentino F
    Chaos; 2018 Dec; 28(12):121102. PubMed ID: 30599516
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Unraveling the hidden complexity of quasideterministic ratchets: Random walks, graphs, and circle maps.
    Blanch-Mercader C; Orlandi JG; Casademunt J
    Phys Rev E; 2020 Jan; 101(1-1):012203. PubMed ID: 32069660
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Backtrackless walks on a graph.
    Aziz F; Wilson RC; Hancock ER
    IEEE Trans Neural Netw Learn Syst; 2013 Jun; 24(6):977-89. PubMed ID: 24808478
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Random walks in weighted networks with a perfect trap: an application of Laplacian spectra.
    Lin Y; Zhang Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Jun; 87(6):062140. PubMed ID: 23848660
    [TBL] [Abstract][Full Text] [Related]  

  • 38. Random walks on graphs for salient object detection in images.
    Gopalakrishnan V; Hu Y; Rajan D
    IEEE Trans Image Process; 2010 Dec; 19(12):3232-42. PubMed ID: 21078566
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Novel shape descriptors for molecular graphs.
    Randić M
    J Chem Inf Comput Sci; 2001; 41(3):607-13. PubMed ID: 11410036
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Dynamic Cluster Formation Game for Attributed Graph Clustering.
    Bu Z; Li HJ; Cao J; Wang Z; Gao G
    IEEE Trans Cybern; 2019 Jan; 49(1):328-341. PubMed ID: 29990077
    [TBL] [Abstract][Full Text] [Related]  

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