Exact Permutation/Randomization Tests Algorithms

Fisher (The design of experiments, Oliver & Boyd, London, 1935) described the exact permutation and randomization tests for comparative experiments without assuming normality or any particular probability distribution. While having this as an attractive feature, the computational challenge was a disadvantage at that time but not now with modern computers. This paper introduces apermutation/randomization data algorithmto generate the permutation/randomization distributions under the null hypotheses for calculating theP-values. The properties ofpermutation/randomization data matricesdeveloped by algorithms following the proposed mathematical processes are derived. Two illustrative examples demonstrate the usefulness of the proposed computational methods.