2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2016★ 2 cited
On unrooted and root-uncertain variants of several well-known phylogenetic network problems
Leo van Iersel, Steven Kelk, Georgios Stamoulis +2
The hybridization number problem requires us to embed a set of binary rooted phylogenetic trees into a binary rooted phylogenetic network such that the number of nodes with indegre…
q-bio.PE2015
A linear bound on the number of states in optimal convex characters for maximum parsimony distance
Olivier Boes, Mareike Fischer, Steven Kelk
Given two phylogenetic trees on the same set of taxa X, the maximum parsimony distance d_MP is defined as the maximum, ranging over all characters c on X, of the absolute differenc…