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 *

127 related articles for article (PubMed ID: 33287063)

  • 21. Fast construction of assembly trees for molecular graphs.
    Artemova S; Grudinin S; Redon S
    J Comput Chem; 2011 Jun; 32(8):1589-98. PubMed ID: 21328401
    [TBL] [Abstract][Full Text] [Related]  

  • 22. Integrating specific and common topologies of heterogeneous graphs and pairwise attributes for drug-related side effect prediction.
    Xuan P; Wang M; Liu Y; Wang D; Zhang T; Nakaguchi T
    Brief Bioinform; 2022 May; 23(3):. PubMed ID: 35470853
    [TBL] [Abstract][Full Text] [Related]  

  • 23. Dual Graph Partitioning Highlights a Small Group of Pseudoknot-Containing RNA Submotifs.
    Jain S; Bayrak CS; Petingi L; Schlick T
    Genes (Basel); 2018 Jul; 9(8):. PubMed ID: 30044451
    [TBL] [Abstract][Full Text] [Related]  

  • 24. A linear delay algorithm for enumerating all connected induced subgraphs.
    Alokshiya M; Salem S; Abed F
    BMC Bioinformatics; 2019 Jun; 20(Suppl 12):319. PubMed ID: 31216984
    [TBL] [Abstract][Full Text] [Related]  

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

  • 26. On the spectrum, energy and Laplacian energy of graphs with self-loops.
    Preetha P U; Suresh M; Bonyah E
    Heliyon; 2023 Jul; 9(7):e17001. PubMed ID: 37415950
    [TBL] [Abstract][Full Text] [Related]  

  • 27. Efficient enumeration of stereoisomers of outerplanar chemical graphs using dynamic programming.
    Imada T; Ota S; Nagamochi H; Akutsu T
    J Chem Inf Model; 2011 Nov; 51(11):2788-807. PubMed ID: 21848281
    [TBL] [Abstract][Full Text] [Related]  

  • 28. (p,q)-biclique counting and enumeration for large sparse bipartite graphs.
    Yang J; Peng Y; Ouyang D; Zhang W; Lin X; Zhao X
    VLDB J; 2023 Mar; ():1-25. PubMed ID: 37362202
    [TBL] [Abstract][Full Text] [Related]  

  • 29. A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.
    Azam NA; Zhu J; Sun Y; Shi Y; Shurbevski A; Zhao L; Nagamochi H; Akutsu T
    Algorithms Mol Biol; 2021 Aug; 16(1):18. PubMed ID: 34391471
    [TBL] [Abstract][Full Text] [Related]  

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

  • 31. The Complexity of Optimal Design of Temporally Connected Graphs.
    Akrida EC; Gąsieniec L; Mertzios GB; Spirakis PG
    Theory Comput Syst; 2017; 61(3):907-944. PubMed ID: 32025196
    [TBL] [Abstract][Full Text] [Related]  

  • 32. Self-supervised contrastive graph representation with node and graph augmentation.
    Duan H; Xie C; Li B; Tang P
    Neural Netw; 2023 Oct; 167():223-232. PubMed ID: 37660671
    [TBL] [Abstract][Full Text] [Related]  

  • 33. Vertex-connectivity in periodic graphs and underlying nets of crystal structures.
    Eon JG
    Acta Crystallogr A Found Adv; 2016 May; 72(Pt 3):376-84. PubMed ID: 27126114
    [TBL] [Abstract][Full Text] [Related]  

  • 34. New concepts of inverse fuzzy mixed graphs and its application.
    Poulik S; Ghorai G
    Granul Comput; 2022; 7(3):549-559. PubMed ID: 38624987
    [TBL] [Abstract][Full Text] [Related]  

  • 35. Learning Hyperedge Replacement Grammars for Graph Generation.
    Aguinaga S; Chiang D; Weninger T
    IEEE Trans Pattern Anal Mach Intell; 2019 Mar; 41(3):625-638. PubMed ID: 29994579
    [TBL] [Abstract][Full Text] [Related]  

  • 36. MISAGA: An Algorithm for Mining Interesting Subgraphs in Attributed Graphs.
    He T; Chan KCC
    IEEE Trans Cybern; 2018 May; 48(5):1369-1382. PubMed ID: 28459699
    [TBL] [Abstract][Full Text] [Related]  

  • 37. Analysis of the relationship among the graphs isomorphic to multilayered cyclic fence graphs (MLCFG).
    Xia J; Hosoya H
    J Chem Inf Comput Sci; 2002; 42(5):1004-10. PubMed ID: 12376987
    [TBL] [Abstract][Full Text] [Related]  

  • 38. MapEff: An Effective Graph Isomorphism Agorithm Based on the Discrete-Time Quantum Walk.
    Liu K; Zhang Y; Lu K; Wang X; Wang X; Tian G
    Entropy (Basel); 2019 Jun; 21(6):. PubMed ID: 33267283
    [TBL] [Abstract][Full Text] [Related]  

  • 39. Graph Thumbnails: Identifying and Comparing Multiple Graphs at a Glance.
    Yoghourdjian V; Dwyer T; Klein K; Marriott K; Wybrow M
    IEEE Trans Vis Comput Graph; 2018 Dec; 24(12):3081-3095. PubMed ID: 29993949
    [TBL] [Abstract][Full Text] [Related]  

  • 40. Novel graph distance matrix.
    Randić M; Pisanski T; Novic M; Plavsić D
    J Comput Chem; 2010 Jul; 31(9):1832-41. PubMed ID: 20301095
    [TBL] [Abstract][Full Text] [Related]  

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