Identifying X-trees with few characters

Simple item page
dc.contributor.authorBordewich, M.
dc.contributor.authorSemple, C.
dc.contributor.authorSteel, M.
dc.date.accessioned2016-05-30T21:36:14Z
dc.date.available2016-05-30T21:36:14Z
dc.date.issued2004en
dc.description.abstractPrevious work has shown the perhaps surprising result that, for any binary phylogenetic tree T, there is a set of four characters that define T. Here we deal with the general case, where T is an arbitrary X-tree. We show that if d is the maximum degree of any vertex in T, then the minimum number of characters that identify T is log₂d (up to a small multiplicative constant).en
dc.identifier.issn1172-8531
dc.identifier.urihttp://hdl.handle.net/10092/12223
dc.language.isoen
dc.publisherUniversity of Canterburyen
dc.rightsAll Rights Reserveden
dc.rights.urihttps://canterbury.libguides.com/rights/theses
dc.subject.anzsrcFields of Research::49 - Mathematical sciences::4901 - Applied mathematics::490102 - Biological mathematicsen
dc.titleIdentifying X-trees with few charactersen
dc.typeDiscussion / Working Papers
uc.collegeFaculty of Engineering
uc.departmentSchool of Engineeringen
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
bordewich_semple_steel_ucdms2004-17_report.pdf
Size:
1002.06 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Engineering: Working Papers