Carter1: Number of trees with m additional steps
Description
Calculate the number of trees with m extra steps under Fitch parsimony
where a leaves are labelled with one state, and b leaves labelled with
a second state.
Usage
Carter1(m, a, b)Log2Carter1(m, a, b)
LogCarter1(m, a, b)
Arguments
a, b
Number of leaves labelled 0 and 1.
Details
Implementation of theorem 1 from Carter1990;textualTreeTools
References
See also:
Steel1993TreeSearch
Steel1995TreeSearch
(Steel1996TreeSearch)