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)

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

  • 2. The distance backbone of directed networks.
    Costa FX; Correia RB; Rocha LM
    Complex Netw Appl XI (2023); 2023; 1078():135-147. PubMed ID: 37916070
    [TBL] [Abstract][Full Text] [Related]  

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

  • 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. Contact networks have small metric backbones that maintain community structure and are primary transmission subgraphs.
    Brattig Correia R; Barrat A; Rocha LM
    PLoS Comput Biol; 2023 Feb; 19(2):e1010854. PubMed ID: 36821564
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Range-limited centrality measures in complex networks.
    Ercsey-Ravasz M; Lichtenwalter RN; Chawla NV; Toroczkai Z
    Phys Rev E Stat Nonlin Soft Matter Phys; 2012 Jun; 85(6 Pt 2):066103. PubMed ID: 23005158
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Ultrametric networks: a new tool for phylogenetic analysis.
    Apostolico A; Comin M; Dress A; Parida L
    Algorithms Mol Biol; 2013 Mar; 8(1):7. PubMed ID: 23497437
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Convex skeletons of complex networks.
    Šubelj L
    J R Soc Interface; 2018 Aug; 15(145):. PubMed ID: 30111666
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Faster Cut Sparsification of Weighted Graphs.
    Forster S; de Vos T
    Algorithmica; 2023; 85(4):929-964. PubMed ID: 37008076
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Distributed algorithms from arboreal ants for the shortest path problem.
    Garg S; Shiragur K; Gordon DM; Charikar M
    Proc Natl Acad Sci U S A; 2023 Feb; 120(6):e2207959120. PubMed ID: 36716366
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Comparison of data-driven thresholding methods using directed functional brain networks.
    Manickam T; Ramasamy V; Doraisamy N
    Rev Neurosci; 2024 Aug; ():. PubMed ID: 39217451
    [TBL] [Abstract][Full Text] [Related]  

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

  • 15. Betweenness centrality in a weighted network.
    Wang H; Hernandez JM; Van Mieghem P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2008 Apr; 77(4 Pt 2):046105. PubMed ID: 18517688
    [TBL] [Abstract][Full Text] [Related]  

  • 16. The Union of Shortest Path Trees of Functional Brain Networks.
    Meier J; Tewarie P; Van Mieghem P
    Brain Connect; 2015 Nov; 5(9):575-81. PubMed ID: 26027712
    [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. 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]  

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

  • 20. Building k edge-disjoint spanning trees of minimum total length for isometric data embedding.
    Yang L
    IEEE Trans Pattern Anal Mach Intell; 2005 Oct; 27(10):1680-3. PubMed ID: 16238003
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.