Aggregating Trees

Aggregates a set of trees with the same leaves to create a consensus tree. The trees are typically obtained via hierarchical clustering, hence the hclust format is used to encode both the aggregated trees and the final consensus tree. The method is exact and proven to be O(nqlog(n)), n being the individuals and q being the number of trees to aggregate.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.1.3 by Audrey Hulot, 2 years ago

Browse source code at

Authors: Audrey Hulot [aut, cre] , Julien Chiquet [aut] , Guillem Rigaill [aut]

Documentation:   PDF Manual  

GPL (>= 2) license

Imports Rcpp

Linking to Rcpp

See at CRAN