1 citations · 1 across the 4 of their papers we have counts for
6 papers
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…
Hybridization Number on Three Rooted Binary Trees is EPT
Leo van Iersel, Steven Kelk, Nela Lekić +2
Phylogenetic networks are leaf-labelled directed acyclic graphs that are used to describe non-treelike evolutionary histories and are thus a generalization of phylogenetic trees. T…
A short note on exponential-time algorithms for hybridization number
Leo van Iersel, Steven Kelk, Nela Lekic +1
In this short note we prove that, given two (not necessarily binary) rooted phylogenetic trees T_1, T_2 on the same set of taxa X, where |X|=n, the hybridization number of T_1 and…
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…
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees
Leo van Iersel, Steven Kelk, Nela Lekić +1
Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two ph…
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…