Four characters suffice to convexly define a phylogenetic tree

Simple item page
dc.contributor.authorHuber, K.
dc.contributor.authorMoulton, V.
dc.contributor.authorSteel, M.
dc.date.accessioned2009-11-25T02:46:03Z
dc.date.available2009-11-25T02:46:03Z
dc.date.issued2005en
dc.description.abstractIt was recently shown that just five characters (functions on a finite set X) suffice to convexly define a trivalent tree with leaf set X. Here we show that four characters suffice which, since three characters is not enough in general, is the best possible.en
dc.identifier.citationHuber, K., Moulton, V., Steel, M. (2005) Four characters suffice to convexly define a phylogenetic tree. SIAM Journal on Discrete Mathematics, 18(4), pp. 835-843.en
dc.identifier.urihttp://hdl.handle.net/10092/3176
dc.language.isoen
dc.publisherUniversity of Canterbury. Mathematics and Statisticsen
dc.rights©2005 Society for Industrial and Applied Mathematicsen
dc.rights.urihttps://hdl.handle.net/10092/17651en
dc.subjectphylogenetic treeen
dc.subjectx-treeen
dc.subjectconvexly defineen
dc.subjectdisplayen
dc.subjectsemidyadic closureen
dc.subjectcharacter compatibilityen
dc.subject.marsdenFields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological Mathematicsen
dc.titleFour characters suffice to convexly define a phylogenetic treeen
dc.typeJournal Article
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
12601708_4char.pdf
Size:
139.25 KB
Format:
Adobe Portable Document Format
Download
Collections
Engineering: Journal Articles