Table 2

Algorithm GSM-FC


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

Output: identified modules;

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

      compute wuv ; add e(u,v) to queue Sq

   End for

(2)While Sq ≠ ∅ do;

      e(u, v) ← Sq;

      If L(u) ≠ L(v) then //L is cluster label

         i = L(u); j =L (v);

         If wuv ==hwu || wuv == hwv then

            V (Ci) = V (Ci) ∪ V(Cj); //C represents the cluster

         End if

      End if

   End while


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

Open Data