Pages that link to "Item:Q5317592"
From MaRDI portal
The following pages link to Four Characters Suffice to Convexly Define a Phylogenetic Tree (Q5317592):
Displayed 6 items.
- On the number of binary characters needed to recover a phylogeny using maximum parsimony (Q545651) (← links)
- On the information content of discrete phylogenetic characters (Q667690) (← links)
- Exact leaf powers (Q982668) (← links)
- A phase transition for a random cluster model on phylogenetic trees. (Q1429803) (← links)
- Phylogenetic information complexity: is testing a tree easier than finding it? (Q1621089) (← links)
- Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters (Q5254033) (← links)