The following pages link to Alex Gavryushkin (Q96710):
Displaying 10 items.
- The combinatorics of discrete time-trees: theory and open problems (Q96717) (← links)
- Computing nearest neighbour interchange distances between ranked phylogenetic trees (Q96718) (← links)
- Discrete coalescent trees (Q96722) (← links)
- Decidable models of small theories (Q266246) (← links)
- The space of ultrametric phylogenetic trees (Q307584) (← links)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- The geometry of partial fitness orders and an efficient method for detecting genetic interactions (Q1784416) (← links)
- Tiling algebra for constraint-based layout editing (Q2397041) (← links)
- Ranked subtree prune and regraft (Q6194022) (← links)
