Pages that link to "Item:Q545651"
From MaRDI portal
The following pages link to On the number of binary characters needed to recover a phylogeny using maximum parsimony (Q545651):
Displaying 7 items.
- Tree reconstruction from multi-state characters (Q696854) (← links)
- Five surprising properties of parsimoniously colored trees (Q1346424) (← links)
- A distance measure based on binary character data and its application to phylogeny reconstruction (Q1919738) (← links)
- Sufficient condition for root reconstruction by parsimony on binary trees with general weights (Q2064854) (← 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)
- Parsimony and the rank of a flattening matrix (Q2687001) (← links)
- Hypothesis testing in perfect phylogeny for a bounded number of characters (Q4593964) (← links)