Pages that link to "Item:Q1430529"
From MaRDI portal
The following pages link to On the combinatorics of rooted binary phylogenetic trees (Q1430529):
Displaying 19 items.
- On agreement forests (Q549253) (← links)
- Bounds on the size of the TBR unit-neighbourhood (Q659604) (← links)
- A cluster reduction for computing the subtree distance between phylogenies (Q659644) (← links)
- Distribution of distances between topologies and its effect on detection of phylogenetic recombination (Q904079) (← links)
- A method for numbering binary rooted and unrooted phylogenies and their hypothetical taxonomic units (Q1065735) (← links)
- Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph (Q1675925) (← links)
- Counting consistent phylogenetic trees is \#P-complete (Q1883389) (← links)
- Tree-tree matrices and other combinatorial problems from taxonomy (Q1911840) (← links)
- Walks in phylogenetic treespace (Q1944961) (← links)
- Enumeration of binary trees compatible with a perfect phylogeny (Q2140024) (← links)
- Combinatorial views on persistent characters in phylogenetics (Q2182613) (← links)
- Neighborhoods of trees in circular orderings (Q2352433) (← links)
- Properties of subtree-prune-and-regraft operations on totally-ordered phylogenetic trees (Q2494464) (← links)
- The Complexity of Rooted Phylogeny Problems (Q3224696) (← links)
- (Q4304358) (← links)
- The SNPR neighbourhood of tree-child networks (Q4585061) (← links)
- Heading in the right direction? Using head moves to traverse phylogenetic network space (Q4994346) (← links)
- Bridging trees for posterior inference on ancestral recombination graphs (Q5243648) (← links)
- Ranked subtree prune and regraft (Q6194022) (← links)