Table 1

Algorithm GSM-CA

Input: a graph G = (V , E), parameters cnin ;

Output: identified modules;

(1) Compute the edge weight

   For each edge e(u,v) ∈E do

      compute wuv;

   End For

(2) Form core

   Select the edge e(u,v) with highest weight in G;

   If wuv < 1 then exit;

   End If

   Initial core C ={u,v};

   While neighbour i whose neighbor j linked by i's highest weight edge

            is in C and cnij cnin do

      C. add (i);

   End While

(3) Select attachments for core

   For each neighbor u of the core C do

      If u's neighbor v linked by u's highest weight edge is in C

         and <a onClick="popup('','MathML',630,470);return false;" target="_blank" href="">View MathML</a>then

         u is selected as attachment of C

      End If

   End For each

(4) Output results and update the highest edge weight

   Output C and delete C from G, update each vertex's highest edge weight in the remaining G

(5) Repeat from step 2 to step 4, until reaching the termination condition of step 2.

He et al. BMC Bioinformatics 2012 13(Suppl 10):S19   doi:10.1186/1471-2105-13-S10-S19

Open Data