Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T17:35:10.930Z Has data issue: false hasContentIssue false

A central limit theorem for the parsimony length of trees

Published online by Cambridge University Press:  01 July 2016

Mike Steel*
Affiliation:
University of Canterbury
Larry Goldstein*
Affiliation:
University of Southern California
Michael S. Waterman*
Affiliation:
University of Southern California
*
∗ Postal address: Department of Mathematics, University of Canterbury, Private Bag, Christchurch, New Zealand.
∗∗ Postal address: Department of Mathematics, University of Southern California, Los Angeles, CA 90089-1113, USA.
∗∗∗ Postal address: Departments of Mathematics and Molecular Biology, University of Southern California, Los Angeles, CA 90089-1113, USA.

Abstract

In phylogenetic analysis it is useful to study the distribution of the parsimony length of a tree under the null model, by which the leaves are independently assigned letters according to prescribed probabilities. Except in one special case, this distribution is difficult to describe exactly. Here we analyze this distribution by providing a recursive and readily computable description, establishing large deviation bounds for the parsimony length of a fixed tree on a single site and for the minimum length (maximum parsimony) tree over several sites. We also show that, under very general conditions, the former distribution converges asymptotically to the normal, thereby settling a recent conjecture. Furthermore, we show how the mean and variance of this distribution can be efficiently calculated. The proof of normality requires a number of new and recent results, as the parsimony length is not directly expressible as a sum of independent random variables, and so normality does not follow immediately from a standard central limit theorem.

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1996 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable