Four Characters Suffice to Convexly Define a Phylogenetic Tree

DOI10.1137/S0895480102416696zbMath1084.92028OpenAlexW2120707543MaRDI QIDQ5317592

Mike A. Steel, Vincent L. Moulton, Katharina T. Huber

Publication date: 16 September 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480102416696

zbMATH Keywords

character compatibilitydisplay\(X\)-treesemidyadic closure

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Taxonomy, cladistics, statistics in mathematical biology (92B10)

Related Items

Phylogenetic information complexity: is testing a tree easier than finding it? ⋮ A phase transition for a random cluster model on phylogenetic trees. ⋮ On the information content of discrete phylogenetic characters ⋮ On the number of binary characters needed to recover a phylogeny using maximum parsimony ⋮ Exact leaf powers ⋮ Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters

This page was built for publication: Four Characters Suffice to Convexly Define a Phylogenetic Tree