Four characters suffice to convexly define a phylogenetic tree
| dc.contributor.author | Huber, Katharina T. | |
| dc.contributor.author | Moulton, Vincent | |
| dc.contributor.author | Steel, Mike | |
| dc.date.accessioned | 2016-03-30T01:17:31Z | |
| dc.date.available | 2016-03-30T01:17:31Z | |
| dc.date.issued | 2002 | en |
| dc.description.abstract | It 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.issn | 1172-8531 | |
| dc.identifier.uri | http://hdl.handle.net/10092/11937 | |
| 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 | phylogenetic tree | en |
| dc.subject | X-tree | en |
| dc.subject | convexly define | en |
| dc.subject | display | en |
| dc.subject | semi-dyadic closure | en |
| dc.subject | character compatibility | en |
| dc.subject.anzsrc | Fields of Research::49 - Mathematical sciences::4904 - Pure mathematics::490404 - Combinatorics and discrete mathematics (excl. physical combinatorics) | en |
| dc.title | Four characters suffice to convexly define a phylogenetic tree | en |
| dc.type | Discussion / Working Papers | |
| uc.college | Faculty of Engineering | |
| uc.department | School of Engineering | en |