View source: R/tree_information.R
TreesMatchingTree | R Documentation |
TreesMatchingTree()
calculates the number of unrooted binary trees that
are consistent with a tree topology on the same leaves.
TreesMatchingTree(tree)
LnTreesMatchingTree(tree)
Log2TreesMatchingTree(tree)
tree |
A tree of class |
Remember to unroot a tree first if the position of its root is arbitrary.
TreesMatchingTree()
returns a numeric specifying the number of
unrooted binary trees that contain all the edges present in the input tree.
LnTreesMatchingTree()
gives the natural logarithm of this number.
Martin R. Smith (martin.smith@durham.ac.uk)
Other tree information functions:
CladisticInfo()
,
NRooted()
partiallyResolvedTree <- CollapseNode(BalancedTree(8), 12:15)
TreesMatchingTree(partiallyResolvedTree)
LnTreesMatchingTree(partiallyResolvedTree)
# Number of rooted trees:
rootedTree <- AddTip(partiallyResolvedTree, where = 0)
TreesMatchingTree(partiallyResolvedTree)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.