Four characters suffice to convexly define a phylogenetic tree
Type of content
Discussion / Working Papers
UC permalink
Publisher's DOI/URI
Thesis discipline
Degree name
Publisher
University of Canterbury
Journal Title
Journal ISSN
Volume Title
Language
Date
2002
Authors
Huber, Katharina T.
Moulton, Vincent
Steel, Mike
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.
Description
Citation
Keywords
phylogenetic tree, X-tree, convexly define, display, semi-dyadic closure, character compatibility
Ngā upoko tukutuku/Māori subject headings
ANZSRC fields of research
Fields of Research::49 - Mathematical sciences::4904 - Pure mathematics::490404 - Combinatorics and discrete mathematics (excl. physical combinatorics)
Rights
All Rights Reserved