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 *

111 related articles for article (PubMed ID: 37420372)

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

  • 42. Simultaneous Matrix Orderings for Graph Collections.
    van Beusekom N; Meulemans W; Speckmann B
    IEEE Trans Vis Comput Graph; 2022 Jan; 28(1):1-10. PubMed ID: 34587024
    [TBL] [Abstract][Full Text] [Related]  

  • 43. The huge Package for High-dimensional Undirected Graph Estimation in R.
    Zhao T; Liu H; Roeder K; Lafferty J; Wasserman L
    J Mach Learn Res; 2012 Apr; 13():1059-1062. PubMed ID: 26834510
    [TBL] [Abstract][Full Text] [Related]  

  • 44. Clustering in complex directed networks.
    Fagiolo G
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Aug; 76(2 Pt 2):026107. PubMed ID: 17930104
    [TBL] [Abstract][Full Text] [Related]  

  • 45. The exact Laplacian spectrum for the Dyson hierarchical network.
    Agliari E; Tavani F
    Sci Rep; 2017 Jan; 7():39962. PubMed ID: 28067261
    [TBL] [Abstract][Full Text] [Related]  

  • 46. Persistent Homology Guided Force-Directed Graph Layouts.
    Suh A; Hajij M; Wang B; Scheidegger C; Rosen P
    IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):697-707. PubMed ID: 31443023
    [TBL] [Abstract][Full Text] [Related]  

  • 47. Matched signal detection on graphs: Theory and application to brain imaging data classification.
    Hu C; Sepulcre J; Johnson KA; Fakhri GE; Lu YM; Li Q
    Neuroimage; 2016 Jan; 125():587-600. PubMed ID: 26481679
    [TBL] [Abstract][Full Text] [Related]  

  • 48. Tight Graph Framelets for Sparse Diffusion MRI
    Yap PT; Dong B; Zhang Y; Shen D
    Med Image Comput Comput Assist Interv; 2016 Oct; 9902():561-569. PubMed ID: 28066844
    [TBL] [Abstract][Full Text] [Related]  

  • 49. Laplacian Estrada and normalized Laplacian Estrada indices of evolving graphs.
    Shang Y
    PLoS One; 2015; 10(3):e0123426. PubMed ID: 25822506
    [TBL] [Abstract][Full Text] [Related]  

  • 50. Robust structure measures of metabolic networks that predict prokaryotic optimal growth temperature.
    Weber Zendrera A; Sokolovska N; Soula HA
    BMC Bioinformatics; 2019 Oct; 20(1):499. PubMed ID: 31615420
    [TBL] [Abstract][Full Text] [Related]  

  • 51. Certain Topological Indices of Non-Commuting Graphs for Finite Non-Abelian Groups.
    Ali F; Rather BA; Sarfraz M; Ullah A; Fatima N; Mashwani WK
    Molecules; 2022 Sep; 27(18):. PubMed ID: 36144784
    [TBL] [Abstract][Full Text] [Related]  

  • 52. Graph drawing using tabu search coupled with path relinking.
    Dib FK; Rodgers P
    PLoS One; 2018; 13(5):e0197103. PubMed ID: 29746576
    [TBL] [Abstract][Full Text] [Related]  

  • 53. Assessing statistical significance in causal graphs.
    Chindelevitch L; Loh PR; Enayetallah A; Berger B; Ziemek D
    BMC Bioinformatics; 2012 Feb; 13():35. PubMed ID: 22348444
    [TBL] [Abstract][Full Text] [Related]  

  • 54. Graph characterization via Ihara coefficients.
    Ren P; Wilson RC; Hancock ER
    IEEE Trans Neural Netw; 2011 Feb; 22(2):233-45. PubMed ID: 21118772
    [TBL] [Abstract][Full Text] [Related]  

  • 55. Amplification on Undirected Population Structures: Comets Beat Stars.
    Pavlogiannis A; Tkadlec J; Chatterjee K; Nowak MA
    Sci Rep; 2017 Mar; 7(1):82. PubMed ID: 28250441
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 58. A Simple Algorithm for Finding All k-Edge-Connected Components.
    Wang T; Zhang Y; Chin FY; Ting HF; Tsin YH; Poon SH
    PLoS One; 2015; 10(9):e0136264. PubMed ID: 26368134
    [TBL] [Abstract][Full Text] [Related]  

  • 59. A Local Structural Descriptor for Image Matching via Normalized Graph Laplacian Embedding.
    Tang J; Shao L; Li X; Lu K
    IEEE Trans Cybern; 2016 Feb; 46(2):410-20. PubMed ID: 25775504
    [TBL] [Abstract][Full Text] [Related]  

  • 60. Joint feature selection and optimal bipartite graph learning for subspace clustering.
    Mei S; Zhao W; Gao Q; Yang M; Gao X
    Neural Netw; 2023 Jul; 164():408-418. PubMed ID: 37182344
    [TBL] [Abstract][Full Text] [Related]  

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