Bounding probabilities in a Markovian model of character evolution
We investigate a probability-based model of character evolution. Using Erdos-Szekely path systems, a sharp upper bound for the probability of a given character evolving under this model is obtained in terms of its parsimony length. In the case of binary characters the conditions under which this bound is realised are determined.
SubjectsField of Research::01 - Mathematical Sciences::0102 - Applied Mathematics
- Engineering: Reports