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 *

123 related articles for article (PubMed ID: 18238100)

  • 1. Maximal prime subgraph decomposition of Bayesian networks.
    Olesen KG; Madsen AL
    IEEE Trans Syst Man Cybern B Cybern; 2002; 32(1):21-31. PubMed ID: 18238100
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 4. Dissecting molecular network structures using a network subgraph approach.
    Huang CH; Zaenudin E; Tsai JJP; Kurubanjerdjit N; Dessie EY; Ng KL
    PeerJ; 2020; 8():e9556. PubMed ID: 33005483
    [TBL] [Abstract][Full Text] [Related]  

  • 5. RASMA: a reverse search algorithm for mining maximal frequent subgraphs.
    Salem S; Alokshiya M; Hasan MA
    BioData Min; 2021 Mar; 14(1):19. PubMed ID: 33726790
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Dense Subgraph Partition of Positive Hypergraphs.
    Liu H; Latecki LJ; Yan S
    IEEE Trans Pattern Anal Mach Intell; 2015 Mar; 37(3):541-54. PubMed ID: 26353260
    [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. Faster algorithms for counting subgraphs in sparse graphs.
    Bressan M
    Algorithmica; 2021; 83(8):2578-2605. PubMed ID: 34720296
    [TBL] [Abstract][Full Text] [Related]  

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

  • 10. Graph rigidity, cyclic belief propagation, and point pattern matching.
    McAuley JJ; Caetano TS; Barbosa MS
    IEEE Trans Pattern Anal Mach Intell; 2008 Nov; 30(11):2047-54. PubMed ID: 18787251
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Correctness of belief propagation in Gaussian graphical models of arbitrary topology.
    Weiss Y; Freeman WT
    Neural Comput; 2001 Oct; 13(10):2173-200. PubMed ID: 11570995
    [TBL] [Abstract][Full Text] [Related]  

  • 12. An efficient algorithm for detecting frequent subgraphs in biological networks.
    Koyutürk M; Grama A; Szpankowski W
    Bioinformatics; 2004 Aug; 20 Suppl 1():i200-7. PubMed ID: 15262800
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 15. Robust subgraph counting with distribution-free random graph analysis.
    van Leeuwaarden JSH; Stegehuis C
    Phys Rev E; 2021 Oct; 104(4-1):044313. PubMed ID: 34781540
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Detection of Network Motif Based on a Novel Graph Canonization Algorithm from Transcriptional Regulation Networks.
    Hu J; Shang X
    Molecules; 2017 Dec; 22(12):. PubMed ID: 29232861
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Network subgraph-based approach for analyzing and comparing molecular networks.
    Huang CH; Zaenudin E; Tsai JJP; Kurubanjerdjit N; Ng KL
    PeerJ; 2022; 10():e13137. PubMed ID: 35529499
    [TBL] [Abstract][Full Text] [Related]  

  • 18. The identification of similarities between biological networks: application to the metabolome and interactome.
    Cootes AP; Muggleton SH; Sternberg MJ
    J Mol Biol; 2007 Jun; 369(4):1126-39. PubMed ID: 17466331
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Estimation and marginalization using the Kikuchi approximation methods.
    Pakzad P; Anantharam V
    Neural Comput; 2005 Aug; 17(8):1836-73. PubMed ID: 15969920
    [TBL] [Abstract][Full Text] [Related]  

  • 20. The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration.
    Houbraken M; Demeyer S; Michoel T; Audenaert P; Colle D; Pickavet M
    PLoS One; 2014; 9(5):e97896. PubMed ID: 24879305
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.