The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
First public release.
Split-based consensus methods:
Strict(), Majority() /
MajorityRule(): wrappers around
TreeTools::Consensus().Loose(): loose (semi-strict / combinable-component)
consensus.Greedy(): greedy (extended majority-rule)
consensus.MajorityPlus(): majority-rule (+) consensus.Frequency(): frequency-difference consensus.Rooted-tree consensus methods:
Adams(): Adams consensus.RStar(): R* consensus, assembled from the strong
clusters of the majority resolved-triplet set (Jansson, Sung, Vu &
Yiu 2016).Local(): local consensus (MinRLC / MinILC).Distance- and branch-length-based summaries:
Average(): distance-based average consensus.Quartet(): tree minimizing the summed symmetric quartet
distance to the inputs (Takazawa et al. 2026).BHVDistance() (Owen-Provan geodesic distance),
BHVPairwiseDistances(), BHVMean() (Fréchet
mean) and BHVVariance().An introductory vignette (ConsTree) demonstrates each
method family on worked exemplars.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.