Last chance! 50% off unlimited learning
Sale ends in
Calculate the number of trees in which Fitch parsimony will reconstruct m steps, where a leaves are labelled with one state, and b leaves are labelled with a second state.
Carter1(m, a, b)Log2Carter1(m, a, b)
LogCarter1(m, a, b)
Number of steps.
Number of leaves labelled 0 and 1.
Implementation of theorem 1 from Carter1990;textualTreeTools
See also:
Steel1993TreeSearch
Steel1995TreeSearch
(Steel1996TreeSearch)
Other profile parsimony functions:
PrepareDataProfile(),
StepInformation(),
WithOneExtraStep(),
profiles
# The character `0 0 0 1 1 1`
Carter1(1, 3, 3) # Exactly one step
Carter1(2, 3, 3) # Two steps (one extra step)
# Number of trees that the character can map onto with exactly _m_ steps
# if non-parsimonious reconstructions are permitted:
cumsum(sapply(1:3, Carter1, 3, 3))
# Three steps allow the character to map onto any of the 105 six-leaf trees.
Run the code above in your browser using DataLab