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

Simple item page
dc.contributor.authorSteel, M.
dc.contributor.authorHamel, A.
dc.date.accessioned2009-11-23T20:27:35Z
dc.date.available2009-11-23T20:27:35Z
dc.date.issued1997en
dc.description.abstractAn 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.en
dc.identifier.citationSteel, M. and Hamel, A. (1997) The length of a random leaf coloration on a random tree.. SIAM J. Discrete Math, 10, pp. 359-372.en
dc.identifier.urihttp://hdl.handle.net/10092/3169
dc.language.isoen
dc.publisherUniversity of Canterbury. Mathematics and Statisticsen
dc.rights.urihttps://hdl.handle.net/10092/17651en
dc.subjectbinary treeen
dc.subjectFitch's algorithmen
dc.subjectmaximum parsimony treeen
dc.subjectDNA/RNA sequencesen
dc.subjectprobabilityen
dc.subject.marsdenFields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological Mathematicsen
dc.subject.marsdenFields of Research::230000 Mathematical Sciences::230100 Mathematicsen
dc.titleThe length of a random leaf coloration on a random tree.en
dc.typeJournal Article
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
38706_angele.pdf
Size:
268.85 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Journal Articles