Number of trees consistent with split
Calculates the number of unrooted bifurcating trees consistent with the specified multi-partition split, using the formula of Carter et al. (1990).
UnrootedTreesMatchingSplit(...) LnUnrootedTreesMatchingSplit(...) Log2UnrootedTreesMatchingSplit(...)
... |
A series or vector of integers listing the number of tips in
each of a number of tree splits (e.g. bipartitions).
For example, |
UnrootedTreesMatchingSplit()
returns an integer specifying the
number of unrooted bifurcating trees consistent with the specified split.
Martin R. Smith (martin.smith@durham.ac.uk)
See Theorem 2 in Carter M, Hendy M, Penny D, Székely LA, Wormald NC (1990). “On the distribution of lengths of evolutionary trees.” SIAM Journal on Discrete Mathematics, 3(1), 38–47. doi: 10.1137/0403005, https://doi.org/10.1137/0403005.
Other split information functions:
CharacterInformation()
,
SplitInformation()
,
SplitMatchProbability()
,
TreesMatchingSplit()
UnrootedTreesMatchingSplit(c(3, 5)) UnrootedTreesMatchingSplit(3, 2, 1, 2)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.