treeperm: 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.

Version: 1.6
Depends: R (≥ 2.14.1)
Published: 2015-04-22
Author: Qiao Kang
Maintainer: Qiao Kang <qk at>
License: GPL-2
NeedsCompilation: yes
CRAN checks: treeperm results


Reference manual: treeperm.pdf
Package source: treeperm_1.6.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
OS X El Capitan binaries: r-release: treeperm_1.6.tgz
OS X Mavericks binaries: r-oldrel: treeperm_1.6.tgz


Please use the canonical form to link to this page.