Exact Permutation Algorithm for Paired Observations: The Challenge of R. A. Fisher | Science Publications

Journal of Mathematics and Statistics

J. I. Odiase¹  S. M. Ogbonmwan¹ 

关键词: Algorithm;    paired observations;    permutation;    p-value;    t-test;   

DOI  :  10.3844/jmssp.2007.116.121

学科分类：社会科学、人文和艺术（综合）

来源: Science Publications

【 摘 要 】

The major handicap of permutation test is the logical and computational requirement necessary to develop and implement the exact permutation scheme. This study provides an algorithm that systematically enumerates all the distinct permutations of the paired observations in an experiment without the possibility of repeating any of the permutations. The permutation algorithm presented completely breaks down the permutation problem for ease of implementation and analysis. The algorithm was illustratively implemented in Intel Visual Fortran to recreate Fisher

【 授权许可】

Unknown