1 citations · 1 across the 4 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2012
Approximation algorithms for nonbinary agreement forests
Leo van Iersel, Steven Kelk, Nela Lekić +1
Given two rooted phylogenetic trees on the same set of taxa X, the Maximum Agreement Forest problem (MAF) asks to find a forest that is, in a certain sense, common to both trees an…
math.CO2011
Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set
Steven Kelk, Leo van Iersel, Nela Lekic +3
We show that the problem of computing the hybridization number of two rooted binary phylogenetic trees on the same set of taxa X has a constant factor polynomial-time approximation…