Identifying phylogenetic trees

dc.contributor.author	Bordewich, M.
dc.contributor.author	Huber, K. T.
dc.contributor.author	Semple, C.
dc.date.accessioned	2016-05-30T21:19:34Z
dc.date.available	2016-05-30T21:19:34Z
dc.date.issued	2004	en
dc.description.abstract	A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection C of partitions of subsets of X, characterisations for the existence and uniqueness of an X-tree that displays C have been previously given in terms of chordal graphs. In this paper, we obtain two closely related characterisations also in terms of chordal graphs. The first describes when C identifies an X-tree, and the second describes when a compatible subset of C is of maximum size.	en
dc.identifier.issn	1172-8531
dc.identifier.uri	http://hdl.handle.net/10092/12221
dc.language.iso	en
dc.publisher	University of Canterbury	en
dc.rights	All Rights Reserved	en
dc.rights.uri	https://canterbury.libguides.com/rights/theses
dc.subject.anzsrc	Fields of Research::49 - Mathematical sciences::4901 - Applied mathematics::490102 - Biological mathematics	en
dc.title	Identifying phylogenetic trees	en
dc.type	Discussion / Working Papers
uc.college	Faculty of Engineering
uc.department	School of Engineering	en

Now showing 1 - 1 of 1

Now showing 1 - 1 of 1