Table 1 The pseudocode of the motif extraction algorithm.

{

{

Result ← {};

G:l     m' ← m;

B ← {m _i |m _i is a cell};

G:2     For each b = Extract(B) with

For each m = Extract(B)

G:3        ((b ~-compatible m'

Iterate(m, B, Result);

          OR (m' ~-compatible b))

Result ← Result;

G:4              If (m' ~-compatible b)

}

G:5                 m _t ← m' ~ b;

G:6                 If Nodelnconsistent(m _t ) exit;

G:7                 If (| _m' | = | _b |) B ← B - {b};

G:8                 If (|| ≤ K)

G:9                    m' ← m _t ;

G:10                    Iterate(m', B, Result);

G:11              If (b ~-compatible m')

G:12                 m _t ← b ~ m';

G:13                 If Nodelnconsistent(m _t ) exit;

G:14                 If (| _m' | = | _b |) B ← B - {b};

G:15                 If (|| ≥ K)

G:16                    m' ← m _t ;

G:17                    Iterate(m', B, Result);

G:18              For each r ∈ Result with _r = _m'

G:19                 If (m' is not maximal w.r.t. r) return;

G:20              Result ← Result ⋃ {m'};

}