Four Characters Suffice to Convexly Define a Phylogenetic Tree

DOI10.1137/S0895480102416696MaRDI QIDQ5317592zbMATH OpenOpenAlexFDO

Authors Katharina T. Huber, Vincent Moulton, Mike Steel

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

\(X\)-treecharacter compatibilitydisplaysemidyadic closure

Mathematics Subject Classification ID

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

Recommendations

• Tree reconstruction from multi-state characters
• Combinatorial Pattern Matching
• Defining a phylogenetic tree with the minimum number of r-state characters
• Recovering trees from well-separated multi-state characters.
• Quartet compatibility and the quartet graph

Cited in

(13)

• Recovering trees from well-separated multi-state characters.
• A phase transition for a random cluster model on phylogenetic trees.
• Phylogenetic information complexity: is testing a tree easier than finding it?
• Sharp upper and lower bounds on a restricted class of convex characters
• Defining a phylogenetic tree with the minimum number of r-state characters
• On the number of binary characters needed to recover a phylogeny using maximum parsimony
• Defining binary phylogenetic trees using parsimony
• Adaptation of the closest tree method for a two state quartet to Jukes-Cantor tripod trees
• 0-1 laws for pattern occurrences in phylogenetic trees and networks
• Phylogenetic trees defined by at most three characters
• On the information content of discrete phylogenetic characters
• Tree reconstruction from multi-state characters
• Exact leaf powers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317592)