The following pages link to Katherine St. John (Q200935):
Displaying 15 items.
- On determining if tree-based networks contain fixed trees (Q309890) (← links)
- Characterizing local optima for maximum parsimony (Q309903) (← links)
- Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
- Rotation distance is fixed-parameter tractable (Q989526) (← links)
- Limit probabilities for random sparse bit strings (Q1378516) (← links)
- Walks in phylogenetic treespace (Q1944961) (← links)
- Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace (Q2197908) (← links)
- Most parsimonious likelihood exhibits multiple optima for compatible characters (Q2299315) (← links)
- Approximating geodesic tree distance (Q2379945) (← links)
- The complexity of random ordered structures (Q2478557) (← links)
- (Q2768289) (← links)
- (Q2768291) (← links)
- Counting Trees in a Phylogenetic Network Is \#P-Complete (Q2862211) (← links)
- A Linear-Time Approximation Algorithm for Rotation Distance (Q3075614) (← links)
- The space of equidistant phylogenetic cactuses (Q6192063) (← links)
