The following pages link to Identifying phylogenetic trees (Q2570101):
Displaying 12 items.
- Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors (Q324834) (← links)
- Groves of phylogenetic trees (Q659789) (← links)
- A note on convex characters, Fibonacci numbers and exponential-time algorithms (Q730310) (← links)
- A characterization for a set of partial partitions to define an \(X\)-tree (Q1598797) (← links)
- On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← links)
- Compatibility of partitions with trees, hierarchies, and split systems (Q2127632) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- Determining the Evolutionary Tree Using Experiments (Q4895795) (← links)
- Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters (Q5254033) (← links)
- (Q6089669) (← links)
- Phylogenetic trees defined by at most three characters (Q6671573) (← links)
