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 *

140 related articles for article (PubMed ID: 35811829)

  • 1. Significant Subgraph Detection in Multi-omics Networks for Disease Pathway Identification.
    Abdel-Hafiz M; Najafi M; Helmi S; Pratte KA; Zhuang Y; Liu W; Kechris KJ; Bowler RP; Lange L; Banaei-Kashani F
    Front Big Data; 2022; 5():894632. PubMed ID: 35811829
    [TBL] [Abstract][Full Text] [Related]  

  • 2. SUBATOMIC: a SUbgraph BAsed mulTi-OMIcs clustering framework to analyze integrated multi-edge networks.
    Loers JU; Vermeirssen V
    BMC Bioinformatics; 2022 Sep; 23(1):363. PubMed ID: 36064320
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Unsupervised discovery of phenotype-specific multi-omics networks.
    Shi WJ; Zhuang Y; Russell PH; Hobbs BD; Parker MM; Castaldi PJ; Rudra P; Vestal B; Hersh CP; Saba LM; Kechris K
    Bioinformatics; 2019 Nov; 35(21):4336-4343. PubMed ID: 30957844
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Context-driven automatic subgraph creation for literature-based discovery.
    Cameron D; Kavuluru R; Rindflesch TC; Sheth AP; Thirunarayan K; Bodenreider O
    J Biomed Inform; 2015 Apr; 54():141-57. PubMed ID: 25661592
    [TBL] [Abstract][Full Text] [Related]  

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

  • 6. Detection of Complexes in Biological Networks Through Diversified Dense Subgraph Mining.
    Ma X; Zhou G; Shang J; Wang J; Peng J; Han J
    J Comput Biol; 2017 Sep; 24(9):923-941. PubMed ID: 28570104
    [TBL] [Abstract][Full Text] [Related]  

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

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

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

  • 10. De novo identification of maximally deregulated subnetworks based on multi-omics data with DeRegNet.
    Winkler S; Winkler I; Figaschewski M; Tiede T; Nordheim A; Kohlbacher O
    BMC Bioinformatics; 2022 Apr; 23(1):139. PubMed ID: 35439941
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Grasping frequent subgraph mining for bioinformatics applications.
    Mrzic A; Meysman P; Bittremieux W; Moris P; Cule B; Goethals B; Laukens K
    BioData Min; 2018; 11():20. PubMed ID: 30202444
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Adaptive Subgraph Neural Network With Reinforced Critical Structure Mining.
    Li J; Sun Q; Peng H; Yang B; Wu J; Yu PS
    IEEE Trans Pattern Anal Mach Intell; 2023 Jul; 45(7):8063-8080. PubMed ID: 37018637
    [TBL] [Abstract][Full Text] [Related]  

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

  • 14. A Two-Phase Algorithm for Differentially Private Frequent Subgraph Mining.
    Cheng X; Su S; Xu S; Xiong L; Xiao K; Zhao M
    IEEE Trans Knowl Data Eng; 2018 Aug; 30(8):1411-1425. PubMed ID: 33223776
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Differentially Private Frequent Subgraph Mining.
    Xu S; Su S; Xiong L; Cheng X; Xiao K
    Proc Int Conf Data Eng; 2016 May; 2016():229-240. PubMed ID: 27616876
    [TBL] [Abstract][Full Text] [Related]  

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

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

  • 18. Auditing SNOMED CT hierarchical relations based on lexical features of concepts in non-lattice subgraphs.
    Cui L; Bodenreider O; Shi J; Zhang GQ
    J Biomed Inform; 2018 Feb; 78():177-184. PubMed ID: 29274386
    [TBL] [Abstract][Full Text] [Related]  

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

  • 20. Mining subgraph coverage patterns from graph transactions.
    Reddy AS; Reddy PK; Mondal A; Priyakumar UD
    Int J Data Sci Anal; 2022; 13(2):105-121. PubMed ID: 34873579
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 7.