Skip to content
Implementation of the treeSeg algorithm as an R package.
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.


For a given tree with binary or continuous observations at the tips, the treeSeg algorithm finds a segmentation which corresponds to a set of inner nodes in the tree. The method is based on a multiscale approach. This controls the probability of overestimating the number of active nodes at level alpha and yields confidence statements for the set of active nodes and the phenotype probabilities.

The treeSeg algorithm is implemented as an R package.

An example on how to use treeSeg can be found in the jupyter notebook illustrationTreeSeg.ipynb.


Do contact us if you need any help with using the software or when you have suggestion on how to improve the implementation.

Email address: behr (at) berkeley (dot) edu

You can’t perform that action at this time.