Steel, M.Hamel, A.2009-11-232009-11-231997Steel, M. and Hamel, A. (1997) The length of a random leaf coloration on a random tree.. SIAM J. Discrete Math, 10, pp. 359-372.http://hdl.handle.net/10092/3169An 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.enbinary treeFitch's algorithmmaximum parsimony treeDNA/RNA sequencesprobabilityJournal ArticleFields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological MathematicsFields of Research::230000 Mathematical Sciences::230100 Mathematics