Show brief item record

dc.contributor.authorLiu, Lu
dc.contributor.authorWei, Jinmao
dc.contributor.authorRuan, Jianhua
dc.date.accessioned2021-04-19T15:04:09Z
dc.date.available2021-04-19T15:04:09Z
dc.date.issued9/28/2017
dc.identifierdoi: 10.3390/genes8100246
dc.identifier.citationGenes 8 (10): 246 (2017)
dc.identifier.urihttps://hdl.handle.net/20.500.12588/392
dc.description.abstractDetecting associations between an input gene set and annotated gene sets (e.g., pathways) is an important problem in modern molecular biology. In this paper, we propose two algorithms, termed NetPEA and NetPEA’, for conducting network-based pathway enrichment analysis. Our algorithms consider not only shared genes but also gene–gene interactions. Both algorithms utilize a protein–protein interaction network and a random walk with a restart procedure to identify hidden relationships between an input gene set and pathways, but both use different randomization strategies to evaluate statistical significance and as a result emphasize different pathway properties. Compared to an over representation-based method, our algorithms can identify more statistically significant pathways. Compared to an existing network-based algorithm, EnrichNet, our algorithms have a higher sensitivity in revealing the true causal pathways while at the same time achieving a higher specificity. A literature review of selected results indicates that some of the novel pathways reported by our algorithms are biologically relevant and important. While the evaluations are performed only with KEGG pathways, we believe the algorithms can be valuable for general functional discovery from high-throughput experiments.
dc.titlePathway Enrichment Analysis with Networks
dc.date.updated2021-04-19T15:04:10Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show brief item record