treeperm: Exact and Asymptotic K Sample Permutation Test

Share:

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.

Author
Qiao Kang <qk@st-andrews.ac.uk>
Date of publication
2015-04-22 22:49:55
Maintainer
Qiao Kang <qk@st-andrews.ac.uk>
License
GPL-2
Version
1.6

View on CRAN

Man pages

KPermutation
K Sample Exact Permutation Test
Permutation
Two Sample Exact Permutation Test
plot.treeperm
Plot Permutations
treeperm
Permutation Tests Using Tree Algorithms
treeperm-package
Exact and Asymptotic K Sample Permutation Test

Files in this package

treeperm
treeperm/src
treeperm/src/Rheaders.h
treeperm/src/Permutation.h
treeperm/src/KPermutation.c
treeperm/src/Permutation.c
treeperm/src/PermFunctions.c
treeperm/NAMESPACE
treeperm/R
treeperm/R/treeperm.R
treeperm/MD5
treeperm/DESCRIPTION
treeperm/man
treeperm/man/treeperm-package.Rd
treeperm/man/KPermutation.Rd
treeperm/man/treeperm.Rd
treeperm/man/plot.treeperm.Rd
treeperm/man/Permutation.Rd