CRAN
TBEST 5.0
Tree Branches Evaluated Statistically for Tightness
Released Dec 29, 2014 by Guoli Sun
This package is available for Renjin and there are no known compatibility issues.
Dependencies
Our method introduces mathematically well-defined measures for tightness of branches in a hierarchical tree. Statistical significance of the findings is determined, for all branches of the tree, by performing permutation tests, optionally with generalized Pareto p-value estimation.
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>TBEST</artifactId>
<version>5.0-b33</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:TBEST')
Test Results
This package was last tested against Renjin 0.9.2644 on Jun 2, 2018.