The length of a random leaf coloration on a random tree.

Type of content
Journal Article
Publisher's DOI/URI
Thesis discipline
Degree name
Publisher
University of Canterbury. Mathematics and Statistics
Journal Title
Journal ISSN
Volume Title
Language
Date
1997
Authors
Steel, M.
Hamel, A.
Abstract

An assignment of colors to objects induces a natural integer weight on each tree that has these objects as leaves. This weight is called "parsimony length" in biostatistics and is the basis of the "maximum parsimony" technique for reconstructing evolutionary trees. Equations for the average value (over all binary trees) of the parsimony length of both xed and random colorations are derived using generating function techniques. This leads to asymptotic results that extend earlier results con ned to just two colors. A potential application to DNA sequence analysis is outlined briefly.

Description
Citation
Steel, M. and Hamel, A. (1997) The length of a random leaf coloration on a random tree.. SIAM J. Discrete Math, 10, pp. 359-372.
Keywords
binary tree, Fitch's algorithm, maximum parsimony tree, DNA/RNA sequences, probability
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Rights