Calculates the number of unrooted bifurcating trees consistent with the specified multi-partition split, using theorem two of Carter1990;textualTreeTools.
Usage
UnrootedTreesMatchingSplit(...)
LnUnrootedTreesMatchingSplit(...)
Log2UnrootedTreesMatchingSplit(...)
Value
UnrootedTreesMatchingSplit()
returns an integer specifying the
number of unrooted bifurcating trees consistent with the specified split.
See also
Other split information functions:
CharacterInformation()
,
SplitInformation()
,
SplitMatchProbability()
,
TreesMatchingSplit()
Examples
UnrootedTreesMatchingSplit(c(3, 5))
#> [1] 315
UnrootedTreesMatchingSplit(3, 2, 1, 2)
#> [1] 297