Maximum splits in an n-leaf tree
SplitsInBinaryTree() is a convenience function to calculate the number of
splits in a fully-resolved (binary) tree with n leaves.
SplitsInBinaryTree(tree) ## S3 method for class 'list' SplitsInBinaryTree(tree) ## S3 method for class 'multiPhylo' SplitsInBinaryTree(tree) ## S3 method for class 'numeric' SplitsInBinaryTree(tree) ## S3 method for class ''NULL'' SplitsInBinaryTree(tree) ## Default S3 method: SplitsInBinaryTree(tree) ## S3 method for class 'Splits' SplitsInBinaryTree(tree) ## S3 method for class 'phylo' SplitsInBinaryTree(tree)
tree |
An object of a supported format that represents a tree or set of trees, from which the number of leaves will be calculated. |
SplitsInBinaryTree() returns an integer vector detailing the number
of unique non-trivial splits in a binary tree with n leaves.
Martin R. Smith (martin.smith@durham.ac.uk)
Other tree properties:
ConsensusWithout(),
NSplits(),
NTip(),
TipLabels(),
TreeIsRooted()
Other Splits operations:
LabelSplits(),
NSplits(),
NTip(),
SplitFrequency(),
TipLabels(),
TipsInSplits(),
as.Splits(),
match()
tree <- TreeTools::BalancedTree(8) SplitsInBinaryTree(tree) SplitsInBinaryTree(TreeTools::as.Splits(tree)) SplitsInBinaryTree(8) SplitsInBinaryTree(list(tree, tree))
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.