Calculates the number of unrooted bifurcating trees consistent with the specified multi-partition split, using theorem two 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, 3, 5
states that a character divides a set of eight tips into
a group of three and a group of five.
UnrootedTreesMatchingSplit()
returns an integer specifying the
number of unrooted bifurcating trees consistent with the specified split.
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 .
Other split information functions:
CharacterInformation()
,
SplitInformation()
,
SplitMatchProbability()
,
TreesMatchingSplit()
UnrootedTreesMatchingSplit(c(3, 5))
#> [1] 315
UnrootedTreesMatchingSplit(3, 2, 1, 2)
#> [1] 297