20 citations · 63 across the 23 of their papers we have counts for
4 papers · 1 filter
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…
A first step towards computing all hybridization networks for two rooted binary phylogenetic trees
Celine Scornavacca, Simone Linz, Benjamin Albrecht
Recently, considerable effort has been put into developing fast algorithms to reconstruct a rooted phylogenetic network that explains two rooted phylogenetic trees and has a minimu…
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
Steven Kelk, Celine Scornavacca
Here we show that, given a set of clusters C on a set of taxa X, where |X|=n, it is possible to determine in time f(k).poly(n) whether there exists a level-<= k network (i.e. a net…
On the elusiveness of clusters
Steven Kelk, Celine Scornavacca, Leo van Iersel
Rooted phylogenetic networks are often used to represent conflicting phylogenetic signals. Given a set of clusters, a network is said to represent these clusters in the "softwired"…