Abstract.
We give formulas for calculating in polynomial time the number of ancestral reconstructions for a tree with binary leaf- and root labels for each number of 0 \(\rightarrow\) 1 and 1 \(\rightarrow\) 0 arcs. For trees of fixed degree, the corresponding numbers of 0 \(\rightarrow\) 0 and 1 \(\rightarrow\) 1 arcs can be deduced. We calculate intervals for the relative cost of 0 \(\rightarrow\) 1 and 1 \(\rightarrow\) 0 transitions over which the same labelings remain the cheapest.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received July 27, 2005
Rights and permissions
About this article
Cite this article
Thierer, T., Bryant, D. & Steel, M. Counting Ancestral Reconstructions in a Fixed Phylogeny. Ann. Comb. 12, 123–132 (2008). https://doi.org/10.1007/s00026-008-0341-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-008-0341-6