An Iterative Information-Theoretic Approach to the Detection of Structures in Complex Systems

Algorithm 1

Sieving algorithm.

Input: The array C of all the CRSs, ranked by their T_c value in descending order.

Output: RS, a subset of C

RS ← ∅

n ← 

Initialize auxiliary array Del[k] ← 0 for k in 1… n

for i = 1 to n − 1 do

 for j = i + 1 to n do

  if Del[i] ≠ 1 ∧ Del[j] ≠ 1 then

   if C[i] ⊂ C[j] ∨ C[j] ⊂ C[i] then

    Del[j] ← 1

   end if

  end if

 end for

end for

for i = 1 to n do

 if Del[i] = 0 then

  RS ← RS ∪ {C[i]}

 end if

end for