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 *

121 related articles for article (PubMed ID: 39131403)

  • 21. Hierarchical clustering in minimum spanning trees.
    Yu M; Hillebrand A; Tewarie P; Meier J; van Dijk B; Van Mieghem P; Stam CJ
    Chaos; 2015 Feb; 25(2):023107. PubMed ID: 25725643
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Pathfinder: Visual Analysis of Paths in Graphs.
    Partl C; Gratzl S; Streit M; Wassermann AM; Pfister H; Schmalstieg D; Lex A
    Comput Graph Forum; 2016 Jun; 35(3):71-80. PubMed ID: 27942090
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Shortest path based network analysis to characterize cognitive load states of human brain using EEG based functional brain networks.
    Thilaga M; Ramasamy V; Nadarajan R; Nandagopal D
    J Integr Neurosci; 2018; 17(2):133-148. PubMed ID: 28968248
    [TBL] [Abstract][Full Text] [Related]  

  • 24. The approximability of shortest path-based graph orientations of protein-protein interaction networks.
    Blokh D; Segev D; Sharan R
    J Comput Biol; 2013 Dec; 20(12):945-57. PubMed ID: 24073924
    [TBL] [Abstract][Full Text] [Related]  

  • 25. Power law of path multiplicity in complex networks.
    Deng Y; Wu J
    PNAS Nexus; 2024 Jun; 3(6):pgae228. PubMed ID: 38894880
    [TBL] [Abstract][Full Text] [Related]  

  • 26. Shortest path counting in complex networks based on powers of the adjacency matrix.
    Tan D; Deng Y; Xiao Y; Wu J
    Chaos; 2024 Oct; 34(10):. PubMed ID: 39432720
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Reconstructing One-Articulated Networks with Distance Matrices.
    Chang KY; Cui Y; Yiu SM; Hon WK
    J Comput Biol; 2018 Mar; 25(3):253-269. PubMed ID: 29028179
    [TBL] [Abstract][Full Text] [Related]  

  • 28. The storage capacity of a directed graph and nodewise autonomous, ubiquitous learning.
    Wei H; Li F
    Front Comput Neurosci; 2023; 17():1254355. PubMed ID: 37927548
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Computing paths and cycles in biological interaction graphs.
    Klamt S; von Kamp A
    BMC Bioinformatics; 2009 Jun; 10():181. PubMed ID: 19527491
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A minimum resource neural network framework for solving multiconstraint shortest path problems.
    Zhang J; Zhao X; He X
    IEEE Trans Neural Netw Learn Syst; 2014 Aug; 25(8):1566-82. PubMed ID: 25050952
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Algorithm for shortest path search in Geographic Information Systems by using reduced graphs.
    Rodríguez-Puente R; Lazo-Cortés MS
    Springerplus; 2013; 2():291. PubMed ID: 24010024
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Graph Transformer Networks: Learning meta-path graphs to improve GNNs.
    Yun S; Jeong M; Yoo S; Lee S; Yi SS; Kim R; Kang J; Kim HJ
    Neural Netw; 2022 Sep; 153():104-119. PubMed ID: 35716619
    [TBL] [Abstract][Full Text] [Related]  

  • 33. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.
    Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S
    PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102
    [TBL] [Abstract][Full Text] [Related]  

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

  • 35. Distance distribution in random graphs and application to network exploration.
    Blondel VD; Guillaume JL; Hendrickx JM; Jungers RM
    Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Dec; 76(6 Pt 2):066101. PubMed ID: 18233892
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning.
    Tesfaye B; Augsten N; Pawlik M; Böhlen MH; Jensen CS
    Inf Syst Front; 2022; 24(1):11-29. PubMed ID: 35310777
    [TBL] [Abstract][Full Text] [Related]  

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

  • 38. Dynamics of neural networks over undirected graphs.
    Goles E; Ruz GA
    Neural Netw; 2015 Mar; 63():156-69. PubMed ID: 25544654
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Tugging graphs faster: efficiently modifying path-preserving hierarchies for browsing paths.
    Archambault D; Munzner T; Auber D
    IEEE Trans Vis Comput Graph; 2011 Mar; 17(3):276-89. PubMed ID: 20421680
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Dynamic algorithms for the shortest path routing problem: learning automata-based solutions.
    Misra S; Oommen BJ
    IEEE Trans Syst Man Cybern B Cybern; 2005 Dec; 35(6):1179-92. PubMed ID: 16366244
    [TBL] [Abstract][Full Text] [Related]  

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