Pages that link to "Item:Q696854"
From MaRDI portal
The following pages link to Tree reconstruction from multi-state characters (Q696854):
Displaying 11 items.
- Linear pencils of tropical plane curves (Q452009) (← links)
- 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)
- Trees, taxonomy, and strongly compatible multi-state characters (Q1364321) (← links)
- Recovering trees from well-separated multi-state characters. (Q1427476) (← 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)
- The size of the character state space affects the occurrence and detection of homoplasy: modelling the probability of incompatibility for unordered phylogenetic characters (Q2415736) (← links)
- Combinatorial Scoring of Phylogenetic Networks (Q2817897) (← links)
- Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters (Q5254033) (← links)
- Phylogenetic trees defined by at most three characters (Q6671573) (← links)
