Huber, Katharina T., Moulton, Vincent ORCID: https://orcid.org/0000-0001-9371-6435 and Steel, Mike
(2005)
Four characters suffice to convexly define a phylogenetic tree.
SIAM Journal on Discrete Mathematics, 18 (4).
pp. 835-843.
ISSN 0895-4801
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 are not enough in general, is the best possible.
Item Type: | Article |
---|---|
Faculty \ School: | Faculty of Science > School of Computing Sciences |
Depositing User: | Vishal Gautam |
Date Deposited: | 09 Mar 2011 08:25 |
Last Modified: | 24 Oct 2022 02:20 |
URI: | https://ueaeprints.uea.ac.uk/id/eprint/23802 |
DOI: | 10.1137/S0895480102416696 |
Actions (login required)
![]() |
View Item |