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: 30790228)

  • 1. Fast Subgraph Matching Strategies Based on Pattern-Only Heuristics.
    Aparo A; Bonnici V; Micale G; Ferro A; Shasha D; Pulvirenti A; Giugno R
    Interdiscip Sci; 2019 Mar; 11(1):21-32. PubMed ID: 30790228
    [TBL] [Abstract][Full Text] [Related]  

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

  • 3. A subgraph isomorphism algorithm and its application to biochemical data.
    Bonnici V; Giugno R; Pulvirenti A; Shasha D; Ferro A
    BMC Bioinformatics; 2013; 14 Suppl 7(Suppl 7):S13. PubMed ID: 23815292
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A coding method for efficient subgraph querying on vertex- and edge-labeled graphs.
    Zhu L; Song Q; Guo Y; Du L; Zhu X; Wang G
    PLoS One; 2014; 9(5):e97178. PubMed ID: 24853266
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Top-k similar graph matching using TraM in biological networks.
    Amin MS; Finley RL; Jamil HM
    IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1790-804. PubMed ID: 22732692
    [TBL] [Abstract][Full Text] [Related]  

  • 6. On the Variable Ordering in Subgraph Isomorphism Algorithms.
    Bonnici V; Giugno R
    IEEE/ACM Trans Comput Biol Bioinform; 2017; 14(1):193-203. PubMed ID: 26761859
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Coupling Graphs, Efficient Algorithms and B-Cell Epitope Prediction.
    Liang Zhao ; Hoi SC; Li Z; Wong L; Nguyen H; Li J
    IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(1):7-16. PubMed ID: 26355502
    [TBL] [Abstract][Full Text] [Related]  

  • 8. An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks.
    He J; Wang C; Qiu K; Zhong W
    BMC Syst Biol; 2014; 8 Suppl 3(Suppl 3):S6. PubMed ID: 25350277
    [TBL] [Abstract][Full Text] [Related]  

  • 9. GRAPES-DD: exploiting decision diagrams for index-driven search in biological graph databases.
    Licheri N; Bonnici V; Beccuti M; Giugno R
    BMC Bioinformatics; 2021 Apr; 22(1):209. PubMed ID: 33888059
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Subgraph queries by context-free grammars.
    Sevon P; Eronen L
    J Integr Bioinform; 2008 Aug; 5(2):. PubMed ID: 20134073
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Discovering topological motifs using a compact notation.
    Parida L
    J Comput Biol; 2007 Apr; 14(3):300-23. PubMed ID: 17563313
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Mining the Enriched Subgraphs for Specific Vertices in a Biological Graph.
    Meysman P; Saeys Y; Sabaghian E; Bittremieux W; Van de Peer Y; Goethals B; Laukens K
    IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(5):1496-1507. PubMed ID: 27295680
    [TBL] [Abstract][Full Text] [Related]  

  • 13. RANGI: a fast list-colored graph motif finding algorithm.
    Rudi AG; Shahrivari S; Jalili S; Moghadam Kashani ZR
    IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(2):504-13. PubMed ID: 23929873
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Computing atom mappings for biochemical reactions without subgraph isomorphism.
    Heinonen M; Lappalainen S; Mielikäinen T; Rousu J
    J Comput Biol; 2011 Jan; 18(1):43-58. PubMed ID: 21210731
    [TBL] [Abstract][Full Text] [Related]  

  • 15. A New Augmentation Based Algorithm for Extracting Maximal Chordal Subgraphs.
    Bhowmick S; Chen TY; Halappanavar M
    J Parallel Distrib Comput; 2015 Feb; 76():132-144. PubMed ID: 25767331
    [TBL] [Abstract][Full Text] [Related]  

  • 16. The index-based subgraph matching algorithm (ISMA): fast subgraph enumeration in large networks using optimized search trees.
    Demeyer S; Michoel T; Fostier J; Audenaert P; Pickavet M; Demeester P
    PLoS One; 2013; 8(4):e61183. PubMed ID: 23620730
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Subgraph-Aware Graph Kernel Neural Network for Link Prediction in Biological Networks.
    Li M; Wang Z; Liu L; Liu X; Zhang W
    IEEE J Biomed Health Inform; 2024 Jul; 28(7):4373-4381. PubMed ID: 38630566
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Discriminative Feature Selection for Uncertain Graph Classification.
    Kong X; Yu PS; Wang X; Ragin AB
    Proc SIAM Int Conf Data Min; 2013; 2013():82-93. PubMed ID: 25949925
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Sensible method for updating motif instances in an increased biological network.
    Kim WY; Kurmar S
    Methods; 2015 Jul; 83():71-9. PubMed ID: 25869675
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Challenging the Time Complexity of Exact Subgraph Isomorphism for Huge and Dense Graphs with VF3.
    Carletti V; Foggia P; Saggese A; Vento M
    IEEE Trans Pattern Anal Mach Intell; 2018 Apr; 40(4):804-818. PubMed ID: 28436848
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.