57 citations · 178 across the 61 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2014
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
Leo van Iersel, Steven Kelk, Nela Lekic +1
A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Pi of the symmetric group S_3. An instance of such a problem consists of a set of variables V a…
cs.CC2011★ 1 cited
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…