Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters

DOI10.1137/130924469zbMath1314.05037OpenAlexW2013593471MaRDI QIDQ5254033

Charles Semple, Magnus Bordewich

Publication date: 8 June 2015

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

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

zbMATH Keywords

chordal graphphylogenetic tree\(r\)-state character

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Tree reconstruction from multi-state characters
• A characterization for a set of partial partitions to define an \(X\)-tree
• A characterisation of rigid circuit graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Identifying phylogenetic trees
• Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters
• Representations of chordal graphs as subtrees of a tree
• Four Characters Suffice to Convexly Define a Phylogenetic Tree

This page was built for publication: Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters