Four Characters Suffice to Convexly Define a Phylogenetic Tree

Authors:
Katharina T. Huber;Vincent Moulton;Mike Steel
Affiliations:
-;-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
2005

Citing 0
Cited 2

Exact leaf powers

Theoretical Computer Science
On a conjecture about compatibility of multi-states characters

WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics

Quantified Score

Hi-index	0.00

Visualization

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.