Four characters suffice to convexly define a phylogenetic tree

Katharina T. Huber; Vincent Moulton; Mike Steel

doi:10.1137/S0895480102416696

Four characters suffice to convexly define a phylogenetic tree

Katharina T. Huber, Vincent Moulton, Mike Steel

Research output: Contribution to journal › Article › peer-review

14 Citations (Scopus)

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.

Original language	English
Pages (from-to)	835-843
Number of pages	9
Journal	SIAM Journal on Discrete Mathematics
Volume	18
Issue number	4
DOIs	https://doi.org/10.1137/S0895480102416696
Publication status	Published - 2005

Access to Document

10.1137/S0895480102416696

Cite this

@article{23f9670591c04d69aaee5507e57975e4,

title = "Four characters suffice to convexly define a phylogenetic tree",

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.",

author = "Huber, {Katharina T.} and Vincent Moulton and Mike Steel",

year = "2005",

doi = "10.1137/S0895480102416696",

language = "English",

volume = "18",

pages = "835--843",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - Four characters suffice to convexly define a phylogenetic tree

AU - Huber, Katharina T.

AU - Moulton, Vincent

AU - Steel, Mike

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

U2 - 10.1137/S0895480102416696

DO - 10.1137/S0895480102416696

M3 - Article

VL - 18

SP - 835

EP - 843

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 4

ER -