Algorithm 1.

$\mathrm{INDEVI}(M,\mathcal{C})$

1:	for each $C=T_C\times I_C\in \mathcal{C}$ do
2:	$\{C_{\mathcal{T}},C_{\mathcal{I}}\}=\text{Preprocess}(M,C)$;
3:	for each entry (i, j) of M do
4:	$loca{l}_{\mathcal{T}}=C_{\mathcal{T}}\left(i\right)$;
5:	$loca{l}_{\mathcal{I}}=C_{\mathcal{I}}\left(j\right)$;
6:	if M(i, j) = 1 then
7:	if i ∈ TC then $loca{l}_{\mathcal{I}}=loca{l}_{\mathcal{I}}-1$; end if {Note the update is on $loca{l}_{\mathcal{I}}$, not $loca{l}_{\mathcal{T}}$, if i ∈ TC}
8:	if j ∈ IC then $loca{l}_{\mathcal{T}}=loca{l}_{\mathcal{T}}-1$; end if {Note the update is on $loca{l}_{\mathcal{T}}$, not $loca{l}_{\mathcal{I}}$, if j ∈ IC}
9:	end if
10:	${\mathcal{F}}_C(i,j)=loca{l}_{\mathcal{T}}\ast loca{l}_{\mathcal{I}}$
11:	if ${\mathcal{F}}_C(i,j)>0$ then
12:	$\mathcal{G}(i,j)=\mathcal{G}(i,j)+1$;{A counter of maximal bicliques of M that contain supporting bicliques for (i, j). It is an auxiliary information for tie breaking.}
13:	if $\mathcal{F}(i,j)<{\mathcal{F}}_C(i,j)$ then
14:	$\mathcal{F}(i,j)={\mathcal{F}}_C(i,j)$;
15:	$c(i,j)=\text{index}\text{of}C\text{in}\mathcal{C}$;{An index for reconstructing evidence of maximum supporting biclique.}
16:	end if
17:	end if
18:	end for
19:	end for
20:	return $\mathcal{F}$, $\mathcal{G}$, c;
Procedure Preprocess(M, C)
1:	for all $i\in \mathcal{T}$ do
2:	$C_{\mathcal{T}}\left(i\right)=\mid I_C\cap Y^{\prime }\mid$ where $Y^{\prime }=\{y:y\in \mathcal{I},M(i,y)=1\}$;
3:	end for
4:	for each $j\in \mathcal{I}$ do
5:	$C_{\mathcal{I}}\left(j\right)=\mid T_C\cap X^{\prime }\mid$ where $X^{\prime }=\{x:x\in \mathcal{T},M(x,j)=1\}$;
6:	end for
7:	return $C_{\mathcal{T}}$, $C_{\mathcal{I}}$