Algorithm 1.
NaivePT The exhaustive permutation testing procedure.
Input: X1, X2, L |
Output: T, hL |
X = [X1; X2], n = n1 + n2 |
m1 …, mL ← [∅] |
for i ∈ 1, …, L do |
j1 …, jn ~ Permute[1, n] |
X̃1 ← X[:, j1, …, jn1], X̃2 ← X[:, jn1+1, …, jn] |
T[:, i] ← test(X̃1, X̃2) |
mi ← Max(T[:, i]) |
end for |
hL ← Histogram(m1, …, mL) |