A polynomial time algorithm for calculating the probability of a ranked gene tree given a species tree
Abstract
In this paper, we provide a polynomial time algorithm to calculate the probability of a {\it ranked} gene tree topology for a given species tree, where a ranked tree topology is a tree topology with the internal vertices being ordered. The probability of a gene tree topology can thus be calculated in polynomial time if the number of orderings of the internal vertices is a polynomial number. However, the complexity of calculating the probability of a gene tree topology with an exponential number of rankings for a given species tree remains unknown.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2012
- DOI:
- 10.48550/arXiv.1203.0204
- arXiv:
- arXiv:1203.0204
- Bibcode:
- 2012arXiv1203.0204S
- Keywords:
-
- Quantitative Biology - Populations and Evolution