Skip to main content
. Author manuscript; available in PMC: 2018 Oct 1.
Published in final edited form as: Neuroimage. 2017 Jul 15;159:79–98. doi: 10.1016/j.neuroimage.2017.07.025

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]
    1X[:, j1, …, jn1], 2X[:, jn1+1, …, jn]
    T[:, i] ← test(1, 2)
    mi ← Max(T[:, i])
  end for
  hL ← Histogram(m1, …, mL)