Question: Finding clusters of interacting proteins in a protein-protein interaction graph
gravatar for rubic
2.3 years ago by
United States
rubic180 wrote:


Given a protein-protein-interaction graph (e.g., from the string data base) and an outcome of a differential expression analysis (i.e., for each gene we have its log fold-change and the associated p-value between the treatment and control), is there a graph-based algorithm that can find subgraph parts enriched with genes which log fold-change p-value is below a given cutoff?

ADD COMMENTlink modified 2.3 years ago by Diwan560 • written 2.3 years ago by rubic180
gravatar for Diwan
2.3 years ago by
United States
Diwan560 wrote:

Given a list of differentially expressed genes, 'keypathwayminer' in cytoscape can extract the highly connected sub-network from PPI. I had used their older version and found it helpful.

Check here for app:

Their recent paper:

To further group the sub-network, you can try 'clusterviz' app in cytoscape to get network clusters.

An application paper that uses both keypathwayminer and clusterviz:

ADD COMMENTlink written 2.3 years ago by Diwan560
Please log in to add an answer.


Use of this site constitutes acceptance of our User Agreement and Privacy Policy.
Powered by Biostar version 2.3.0
Traffic: 823 users visited in the last hour