CRAN
treeperm 1.6
Exact and Asymptotic K Sample Permutation Test
Released Apr 22, 2015 by Qiao Kang
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.
Installation
Maven
This package can be included as a dependency from a Java or Scala project by including
the following your project's pom.xml file.
Read more
about embedding Renjin in JVM-based projects.
<dependencies>
<dependency>
<groupId>org.renjin.cran</groupId>
<artifactId>treeperm</artifactId>
<version>1.6-b270</version>
</dependency>
</dependencies>
<repositories>
<repository>
<id>bedatadriven</id>
<name>bedatadriven public repo</name>
<url>https://nexus.bedatadriven.com/content/groups/public/</url>
</repository>
</repositories>
Renjin CLI
If you're using Renjin from the command line, you load this library by invoking:
library('org.renjin.cran:treeperm')
Test Results
This package was last tested against Renjin 0.9.2689 on Aug 26, 2018.