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)

  • 21. Tight analysis of the (1+1)-EA for the single source shortest path problem.
    Doerr B; Happ E; Klein C
    Evol Comput; 2011; 19(4):673-91. PubMed ID: 21838552
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Shortest Path Edit Distance for Enhancing UMLS Integration and Audit.
    Rudniy A; Geller J; Song M
    AMIA Annu Symp Proc; 2010 Nov; 2010():697-701. PubMed ID: 21347068
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Dijkstra's algorithm to find the nearest vaccine location.
    Jason ; Siever M; Valentino A; Suryaningrum KM; Yunanda R
    Procedia Comput Sci; 2023; 216():5-12. PubMed ID: 36643180
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A new algorithm to find fuzzy Hamilton cycle in a fuzzy network using adjacency matrix and minimum vertex degree.
    Nagoor Gani A; Latha SR
    Springerplus; 2016; 5(1):1854. PubMed ID: 27818892
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. Multitarget Tracking Algorithm Based on Adaptive Network Graph Segmentation in the Presence of Measurement Origin Uncertainty.
    Ma T; Gao S; Chen C; Song X
    Sensors (Basel); 2018 Nov; 18(11):. PubMed ID: 30404155
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Incremental Multi-Scale Search Algorithm for Dynamic Path Planning With Low Worst-Case Complexity.
    Yibiao Lu ; Xiaoming Huo ; Arslan O; Tsiotras P
    IEEE Trans Syst Man Cybern B Cybern; 2011 Dec; 41(6):1556-70. PubMed ID: 21690015
    [TBL] [Abstract][Full Text] [Related]  

  • 28. Quantum Experiments and Graphs: Multiparty States as Coherent Superpositions of Perfect Matchings.
    Krenn M; Gu X; Zeilinger A
    Phys Rev Lett; 2017 Dec; 119(24):240403. PubMed ID: 29286732
    [TBL] [Abstract][Full Text] [Related]  

  • 29. Graph Matching with Adaptive and Branching Path Following.
    Wang T; Ling H; Lang C; Feng S
    IEEE Trans Pattern Anal Mach Intell; 2018 Dec; 40(12):2853-2867. PubMed ID: 29989966
    [TBL] [Abstract][Full Text] [Related]  

  • 30. A Functional Representation for Graph Matching.
    Wang FD; Xue N; Zhang Y; Xia GS; Pelillo M
    IEEE Trans Pattern Anal Mach Intell; 2020 Nov; 42(11):2737-2754. PubMed ID: 31144627
    [TBL] [Abstract][Full Text] [Related]  

  • 31. Inferring branching pathways in genome-scale metabolic networks.
    Pitkänen E; Jouhten P; Rousu J
    BMC Syst Biol; 2009 Oct; 3():103. PubMed ID: 19874610
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Explaining a Weighted DAG with Few Paths for Solving Genome-Guided Multi-Assembly.
    Tomescu AI; Gagie T; Popa A; Rizzi R; Kuosmanen A; Mäkinen V
    IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1345-54. PubMed ID: 26671806
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Graph transformation and shortest paths algorithms for finite Markov chains.
    Sharpe DJ; Wales DJ
    Phys Rev E; 2021 Jun; 103(6-1):063306. PubMed ID: 34271741
    [TBL] [Abstract][Full Text] [Related]  

  • 34. Factorized Graph Matching.
    Zhou F; de la Torre F
    IEEE Trans Pattern Anal Mach Intell; 2016 Sep; 38(9):1774-1789. PubMed ID: 26595909
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Cycle Based Network Centrality.
    Zhou X; Liang X; Zhao J; Zhang S
    Sci Rep; 2018 Aug; 8(1):11749. PubMed ID: 30082835
    [TBL] [Abstract][Full Text] [Related]  

  • 36. Transduction on Directed Graphs via Absorbing Random Walks.
    De J; Zhang X; Lin F; Cheng L; De J; Xiaowei Zhang ; Feng Lin ; Li Cheng ; De J; Cheng L; Zhang X; Lin F
    IEEE Trans Pattern Anal Mach Intell; 2018 Jul; 40(7):1770-1784. PubMed ID: 28809671
    [TBL] [Abstract][Full Text] [Related]  

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

  • 38. Path similarity skeleton graph matching.
    Bai X; Latecki LJ
    IEEE Trans Pattern Anal Mach Intell; 2008 Jul; 30(7):1282-92. PubMed ID: 18550909
    [TBL] [Abstract][Full Text] [Related]  

  • 39. On the centrality of vertices of molecular graphs.
    Randić M; Novič M; Vračko M; Plavšić D
    J Comput Chem; 2013 Nov; 34(29):2514-23. PubMed ID: 23955387
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Associating approximate paths and temporal sequences of noisy detections: Application to the recovery of spatio-temporal cancer cell trajectories.
    Dorfer M; Kazmar T; Šmíd M; Sing S; Kneißl J; Keller S; Debeir O; Luber B; Mattes J
    Med Image Anal; 2016 Jan; 27():72-83. PubMed ID: 25987193
    [TBL] [Abstract][Full Text] [Related]  

    [Previous]   [Next]    [New Search]
    of 6.