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 *

177 related articles for article (PubMed ID: 31741499)

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

  • 2. Local Multiset Dimension of Amalgamation Graphs.
    Alfarisi R; Susilowati L; Dafik D; Prabhu S
    F1000Res; 2023; 12():95. PubMed ID: 38835804
    [No Abstract]   [Full Text] [Related]  

  • 3. Computing the partition dimension of certain families of Toeplitz graph.
    Luo R; Khalil A; Ahmad A; Azeem M; Ibragimov G; Nadeem MF
    Front Comput Neurosci; 2022; 16():959105. PubMed ID: 36313814
    [TBL] [Abstract][Full Text] [Related]  

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

  • 5. The partition dimension of the vertex amalgamation of some cycles.
    Hasmawati ; Hinding N; Nurwahyu B; Syukur Daming A; Kamal Amir A
    Heliyon; 2022 Jun; 8(6):e09596. PubMed ID: 35711982
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Learning Hidden Graphs From Samples.
    Abniki A; Beigy H
    IEEE Trans Pattern Anal Mach Intell; 2023 Oct; 45(10):11993-12003. PubMed ID: 37285255
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 10. Random graphs with arbitrary degree distributions and their applications.
    Newman ME; Strogatz SH; Watts DJ
    Phys Rev E Stat Nonlin Soft Matter Phys; 2001 Aug; 64(2 Pt 2):026118. PubMed ID: 11497662
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Bounds on the Partition Dimension of Convex Polytopes.
    Liu JB; Nadeem MF; Azeem M
    Comb Chem High Throughput Screen; 2022; 25(3):547-553. PubMed ID: 33280591
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

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

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

  • 17. Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs.
    Nishiyama Y; Shurbevski A; Nagamochi H; Akutsu T
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):77-90. PubMed ID: 29994050
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

    [Next]    [New Search]
    of 9.