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 *

130 related articles for article (PubMed ID: 35789916)

  • 1. Most relevant point query on road networks.
    Zhang Z; Yang S; Qin Y; Yang Z; Huang Y; Zhou X
    Neural Comput Appl; 2022 Jun; ():1-11. PubMed ID: 35789916
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. A distributed query execution engine of big attributed graphs.
    Batarfi O; Elshawi R; Fayoumi A; Barnawi A; Sakr S
    Springerplus; 2016; 5(1):665. PubMed ID: 27350905
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 7. A Study of the Improved A* Algorithm Incorporating Road Factors for Path Planning in Off-Road Emergency Rescue Scenarios.
    Zhao D; Ni L; Zhou K; Lv Z; Qu G; Gao Y; Yuan W; Wu Q; Zhang F; Zhang Q
    Sensors (Basel); 2024 Aug; 24(17):. PubMed ID: 39275555
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Geo-Social Top-
    Attique M; Afzal M; Ali F; Mehmood I; Ijaz MF; Cho HJ
    Sensors (Basel); 2020 Feb; 20(3):. PubMed ID: 32024087
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model.
    Wei H; Zhang S; He X
    Sensors (Basel); 2020 Dec; 21(1):. PubMed ID: 33396895
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 12. Representing Graphs via Gromov-Wasserstein Factorization.
    Xu H; Liu J; Luo D; Carin L
    IEEE Trans Pattern Anal Mach Intell; 2023 Jan; 45(1):999-1016. PubMed ID: 35196227
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 15. ABCDE: Approximating Betweenness-Centrality ranking with progressive-DropEdge.
    Mirakyan M
    PeerJ Comput Sci; 2021; 7():e699. PubMed ID: 34604524
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Distance-Constraint k-Nearest Neighbor Searching in Mobile Sensor Networks.
    Han Y; Park K; Hong J; Ulamin N; Lee YK
    Sensors (Basel); 2015 Jul; 15(8):18209-28. PubMed ID: 26225969
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Critical-edge based tabu search algorithm for solving large-scale multi-vehicle Chinese postman problem.
    Tang J; He L; Cao Y; Bai H
    Sci Rep; 2024 May; 14(1):12437. PubMed ID: 38816559
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Query-Specific Deep Embedding of Content-Rich Network.
    Li Y; Wang H; Yu L; Cooper SY; Wang JY
    Comput Intell Neurosci; 2020; 2020():5943798. PubMed ID: 32908476
    [TBL] [Abstract][Full Text] [Related]  

  • 19. SING: subgraph search in non-homogeneous graphs.
    Di Natale R; Ferro A; Giugno R; Mongiovì M; Pulvirenti A; Shasha D
    BMC Bioinformatics; 2010 Feb; 11():96. PubMed ID: 20170516
    [TBL] [Abstract][Full Text] [Related]  

  • 20. An efficient algorithm for maximizing range sum queries in a road network.
    Phan TK; Jung H; Kim UM
    ScientificWorldJournal; 2014; 2014():541602. PubMed ID: 25152915
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.