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 *

202 related articles for article (PubMed ID: 37213330)

  • 1. Factorization and pseudofactorization of weighted graphs.
    Sheridan K; Berleant J; Bathe M; Condon A; Williams VV
    Discrete Appl Math; 2023 Oct; 337():81-105. PubMed ID: 37213330
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Isometric Hamming embeddings of weighted graphs.
    Berleant J; Sheridan K; Condon A; Williams VV; Bathe M
    Discrete Appl Math; 2023 Jun; 332():119-128. PubMed ID: 37982050
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Edge Distance-based Topological Indices of Strength-weighted Graphs and their Application to Coronoid Systems, Carbon Nanocones and SiO
    Arockiaraj M; Klavžar S; Clement J; Mushtaq S; Balasubramanian K
    Mol Inform; 2019 Nov; 38(11-12):e1900039. PubMed ID: 31529609
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 6. Biological applications of knowledge graph embedding models.
    Mohamed SK; Nounu A; Nováček V
    Brief Bioinform; 2021 Mar; 22(2):1679-1693. PubMed ID: 32065227
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Dynamic Graph Stream Algorithms in
    Huang Z; Peng P
    Algorithmica; 2019; 81(5):1965-1987. PubMed ID: 31057194
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Characterization of 2-Path Product Signed Graphs with Its Properties.
    Sinha D; Sharma D
    Comput Intell Neurosci; 2017; 2017():1235715. PubMed ID: 28761437
    [TBL] [Abstract][Full Text] [Related]  

  • 9. AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS.
    Kundeti V; Rajasekaran S; Dinh H
    Discrete Math Algorithms Appl; 2010; 1():184-196. PubMed ID: 25364472
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Graph characterization via Ihara coefficients.
    Ren P; Wilson RC; Hancock ER
    IEEE Trans Neural Netw; 2011 Feb; 22(2):233-45. PubMed ID: 21118772
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.
    Novotná J; Okrasa K; Pilipczuk M; Rzążewski P; van Leeuwen EJ; Walczak B
    Algorithmica; 2021; 83(8):2634-2650. PubMed ID: 34720297
    [TBL] [Abstract][Full Text] [Related]  

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

  • 13. A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs.
    Liang Z; Wei H
    Comput Intell Neurosci; 2021; 2021():7667656. PubMed ID: 34650606
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An extended dual graph library and partitioning algorithm applicable to pseudoknotted RNA structures.
    Jain S; Saju S; Petingi L; Schlick T
    Methods; 2019 Jun; 162-163():74-84. PubMed ID: 30928508
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
    Dinh H; Rajasekaran S
    Bioinformatics; 2011 Jul; 27(14):1901-7. PubMed ID: 21636593
    [TBL] [Abstract][Full Text] [Related]  

  • 16. The Connected
    Bai C; Zhou J; Liang Z
    Comput Intell Neurosci; 2021; 2021():3533623. PubMed ID: 34992643
    [TBL] [Abstract][Full Text] [Related]  

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

  • 18. A spectral graph convolution for signed directed graphs via magnetic Laplacian.
    Ko T; Choi Y; Kim CK
    Neural Netw; 2023 Jul; 164():562-574. PubMed ID: 37216757
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Bond topology of chain, ribbon and tube silicates. Part II. Geometrical analysis of infinite 1D arrangements of (TO
    Day MC; Hawthorne FC; Rostami A
    Acta Crystallogr A Found Adv; 2024 May; 80(Pt 3):258-281. PubMed ID: 38683645
    [