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: 39108292)

  • 1. A fast algorithm for All-Pairs-Shortest-Paths suitable for neural networks.
    Jing Z; Meister M
    ArXiv; 2024 Jul; ():. PubMed ID: 39108292
    [TBL] [Abstract][Full Text] [Related]  

  • 2. A Fast Algorithm for All-Pairs-Shortest-Paths Suitable for Neural Networks.
    Jing Z; Meister M
    Neural Comput; 2024 Nov; 36(12):2710-2733. PubMed ID: 39383024
    [TBL] [Abstract][Full Text] [Related]  

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

  • 4. The ultrametric backbone is the union of all minimum spanning forests.
    Rozum JC; Rocha LM
    J Phys Complex; 2024 Sep; 5(3):035009. PubMed ID: 39131403
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Network orientation via shortest paths.
    Silverbush D; Sharan R
    Bioinformatics; 2014 May; 30(10):1449-55. PubMed ID: 24470573
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Factorization and pseudofactorization of weighted graphs.
    Sheridan K; Berleant J; Bathe M; Condon A; Williams VV
    Discrete Appl Math; 2023 Oct; 337():81-105. PubMed ID: 37213330
    [TBL] [Abstract][Full Text] [Related]  

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

  • 9. The hippocampus as a cognitive graph.
    Muller RU; Stead M; Pach J
    J Gen Physiol; 1996 Jun; 107(6):663-94. PubMed ID: 8783070
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Unifying Offline and Online Multi-Graph Matching via Finding Shortest Paths on Supergraph.
    Jiang Z; Wang T; Yan J
    IEEE Trans Pattern Anal Mach Intell; 2021 Oct; 43(10):3648-3663. PubMed ID: 32340936
    [TBL] [Abstract][Full Text] [Related]  

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

  • 12. A bag-of-paths framework for network data analysis.
    Françoisse K; Kivimäki I; Mantrach A; Rossi F; Saerens M
    Neural Netw; 2017 Jun; 90():90-111. PubMed ID: 28458082
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Reconfiguring Shortest Paths in Graphs.
    Gajjar K; Jha AV; Kumar M; Lahiri A
    Algorithmica; 2024; 86(10):3309-3338. PubMed ID: 39359538
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Shortest-Path Percolation on Random Networks.
    Kim M; Radicchi F
    Phys Rev Lett; 2024 Jul; 133(4):047402. PubMed ID: 39121422
    [TBL] [Abstract][Full Text] [Related]  

  • 16. On the VC-Dimension of Unique Round-Trip Shortest Path Systems.
    Zhu CJ; Lam KY; Yin Ng JK; Bi J
    Inf Process Lett; 2019 May; 145():1-5. PubMed ID: 31741499
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Probabilistic inference and ranking of gene regulatory pathways as a shortest-path problem.
    Jensen JD; Jensen DM; Clement MJ; Snell QO
    BMC Bioinformatics; 2013; 14 Suppl 13(Suppl 13):S5. PubMed ID: 24266986
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Faster heuristics for graph burning.
    Gautam RK; Kare AS; S DB
    Appl Intell (Dordr); 2022; 52(2):1351-1361. PubMed ID: 34764602
    [TBL] [Abstract][Full Text] [Related]  

  • 19. The distance backbone of complex networks.
    Simas T; Correia RB; Rocha LM
    J Complex Netw; 2021 Dec; 9(6):. PubMed ID: 38348382
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Fast computing betweenness centrality with virtual nodes on large sparse networks.
    Yang J; Chen Y
    PLoS One; 2011; 6(7):e22557. PubMed ID: 21818337
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.