Exact and Asymptotic K Sample Permutation Test

An implementation of permutation tests in R, supporting both exact and asymptotic K sample test of data locations. The p value of exact tests is found using tree algorithms. Tree algorithms treat permutations of input data as tree nodes and perform constraint depth-first searches for permutations that fall into the critical region of a test systematically. Pruning of tree search and optimisations at C level enable exact tests for certain large data sets.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


1.6 by Qiao Kang, 6 years ago

Browse source code at https://github.com/cran/treeperm

Authors: Qiao Kang <[email protected]>

Documentation:   PDF Manual  

GPL-2 license

See at CRAN