TreeTools (version 0.1.3)

UnrootedTreesMatchingSplit: Number of trees consistent with split

Description

Calculates the number of unrooted bifurcating trees consistent with the specified multi-partition split, using the formula of Carter et al. (1990).

Usage

UnrootedTreesMatchingSplit(splits)

Arguments

splits

A vector of integers listing the number of tips in each of a number of tree splits (e.g. bipartitions). For example, c(3, 5) states that a character divides a set of eight tips into a group of three and a group of five.

Value

UnrootedTreesMatchingSplit returns an integer specifying the number of unrooted bifurcating trees consistent with the specified split.

References

See Theorem 2 in Carter1990TreeTools

See Also

Other split information functions: CharacterInformation, SplitInformation, TreesMatchingSplit

Examples

# NOT RUN {
 UnrootedTreesMatchingSplit(c(3, 5))
 UnrootedTreesMatchingSplit(c(3, 2, 1, 2))

# }