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.
|Author||Audrey Hulot [aut, cre], Julien Chiquet [aut] (<https://orcid.org/0000-0002-3629-3429>), Guillem Rigaill [aut]|
|Maintainer||Audrey Hulot <[email protected]>|
|License||GPL (>= 2)|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.