UnrootedTreesMatchingSplit: Number of trees consistent with split
Description
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.
Arguments
...
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.