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 *

110 related articles for article (PubMed ID: 32340936)

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

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

  • 3. Multi-Graph Matching via Affinity Optimization with Graduated Consistency Regularization.
    Yan J; Cho M; Zha H; Yang X; Chu SM
    IEEE Trans Pattern Anal Mach Intell; 2016 Jun; 38(6):1228-42. PubMed ID: 26372208
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A Fast Algorithm for All-Pairs-Shortest-Paths Suitable for Neural Networks.
    Jing Z; Meister M
    Neural Comput; 2024 Oct; ():1-24. PubMed ID: 39383024
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra PK
    J Zhejiang Univ Sci; 2004 Sep; 5(9):1135-43. PubMed ID: 15323010
    [TBL] [Abstract][Full Text] [Related]  

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

  • 8. Shortest Paths in Multiplex Networks.
    Ghariblou S; Salehi M; Magnani M; Jalili M
    Sci Rep; 2017 May; 7(1):2142. PubMed ID: 28526822
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 11. Generative Graph Prototypes from Information Theory.
    Han L; Wilson RC; Hancock ER
    IEEE Trans Pattern Anal Mach Intell; 2015 Oct; 37(10):2013-27. PubMed ID: 26340255
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Consistency-driven alternating optimization for multigraph matching: a unified approach.
    Yan J; Wang J; Zha H; Yang X; Chu S
    IEEE Trans Image Process; 2015 Mar; 24(3):994-1009. PubMed ID: 25576568
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

  • 17. Centrality and the shortest path approach in the human interactome.
    Rubanova N; Morozova N
    J Bioinform Comput Biol; 2019 Aug; 17(4):1950027. PubMed ID: 31617463
    [TBL] [Abstract][Full Text] [Related]  

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

  • 19. An Almost Linear Time Algorithm for Field Splitting in Radiation Therapy.
    Wu X; Dou X; Bayouth JE; Buatti JM
    Comput Geom; 2013 Aug; 46(6):673-687. PubMed ID: 24999294
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Path matching and graph matching in biological networks.
    Yang Q; Sze SH
    J Comput Biol; 2007; 14(1):56-67. PubMed ID: 17381346
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 6.