Algorithm 8.

[combinations] = RANKTESTS(N, K, combinations)

Input:
	reduced stoichiometry matrix Nm×q; current nullspace matrix ${\text{K}}_{\text{q}\times (\text{q}-\text{m})}=\left[\begin{array}{l}{\text{R}}^{(1)}\hfill \\ {\text{R}}^{(2)}\hfill \end{array}\right]$;
	array of pairs of column-generating indices (combinations)
Output:
	array column-generating pairs valid elementary modes (combinations)
1:	k ⇐ size(R(1), 1)
2:	for each (ii, jj) ∈ combinations do
3:	x1×k ⇐ ${\text{R}}_{\ast ,\text{ii}}^{(1)}$ or ${\text{R}}_{\ast ,\text{jj}}^{(1)}$
4:	aa ⇐ indices of non-zero entries in x1…q−m
5:	bb ⇐ indices of zero entries in xq−m+1….k
6:	{if Proposition 5 is not satisfied reject candidate}
7:	if NULLITY(Nbb, aa) ≠ 1 then
8:	combinations ⇐ combinations\(ii, jj)
9:	end if
10:	end for