|
|||||
|
|
Counting Ancestral Reconstructions in a Fixed Phylogeny |
|
| Authors: | Tobias Thierer David Bryant Mike Steel |
| Institution: | (1) Proteomics Algorithmen und Simulation, ZBIT, Sand 14, 72076 Tübingen, Germany;(2) Department of Mathematics, University of Auckland, Auckland Mail Centre, Private Bag 92019, Auckland, 1142, New Zealand;(3) McGill Centre for Bioinformatics, 3775 University Street, Montreal, Quebec, H3A 2B4, Canada;(4) Biomathematics Research Centre, University of Canterbury, Private Bag 4800, Christchurch, 8140, New Zealand |
| 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  1 and 1  0 arcs. For trees of fixed degree, the corresponding numbers of 0  0 and 1  1 arcs can be deduced. We calculate intervals for the relative cost of 0  1 and 1  0 transitions over which the same labelings remain the cheapest.
Received July 27, 2005 |
| Keywords: | :" target="_blank">: generating function phylogenetic tree binary character transition |
| 本文献已被 SpringerLink 等数据库收录！ | |