Calculates the number of unrooted bifurcating trees consistent with the specified multi-partition split, using theorem two of Carter et al. (1990) .
Usage
UnrootedTreesMatchingSplit(...)
LnUnrootedTreesMatchingSplit(...)
Log2UnrootedTreesMatchingSplit(...)
Value
UnrootedTreesMatchingSplit()
returns an integer specifying the
number of unrooted bifurcating trees consistent with the specified split.
References
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 .
See also
Other split information functions:
CharacterInformation()
,
SplitInformation()
,
SplitMatchProbability()
,
TreesMatchingSplit()
Examples
UnrootedTreesMatchingSplit(c(3, 5))
#> [1] 315
UnrootedTreesMatchingSplit(3, 2, 1, 2)
#> [1] 297