Tree distance measuresFunctions for calculating distances between pairs of trees. |
|
|---|---|
|
|
Information-based generalized Robinson-Foulds distances |
Nye et al. (2006) tree comparison |
|
Kendall-Colijn distance |
|
Matching Split Distance |
|
Jaccard-Robinson-Foulds metric |
|
Maximum Agreement Subtree size |
|
Approximate Nearest Neighbour Interchange distance |
|
Path distance |
|
|
|
Robinson-Foulds distances, with adjustments for phylogenetic information content |
Approximate Subtree Prune and Regraft distance |
|
InformationFunctions addressing the information content and entropy of splits. |
|
Variation of information for all split pairings |
|
Entropy in bits |
|
Use variation of clustering information to compare pairs of splits |
|
Are splits compatible? |
|
Clustering entropy of all splits within a tree |
|
Entropy of two splits |
|
|
|
Shared information content of two splits |
Information content of splits within a tree |
|
Utility functionsFunctions to facilitate interaction with the package. |
|
Distances between each pair of trees |
|
Median of a set of trees |
|
Solve linear assignment problem using LAPJV |
|
Visualise a matching |
|