Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set

  title={Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set},
  author={Steven M. Kelk and Leo van Iersel and Nela Lekic and Simone Linz and C{\'e}line Scornavacca and Leen Stougie},
  journal={SIAM J. Discret. Math.},
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 if and only if the problem of computing a minimum-size feedback vertex set in a directed graph (DFVS) has a constant factor polynomial-time approximation. The latter problem, which asks for a minimum number of vertices to be removed from a directed graph to transform it into a directed acyclic graph, is one of the… 

Figures from this paper

Deciding the existence of a cherry-picking sequence is hard on two trees

Computing nonbinary agreement forests

It is shown that nonbinary MAF has a polynomial-time 4-approximation and an (exact) fixed-parameter tractable algorithm that runs in O(4^k poly(n)) time.

Hybridization Number on Three Rooted Binary Trees is EPT

The techniques generalize to more than three input trees with the exception of one key lemma that maps nodes in the network to tree nodes and, thus, minimizes the amount of guessing involved in constructing the network.

Kernelizations for the hybridization number problem on multiple nonbinary trees

Hybridization Number on Three Trees

This article presents an algorithm for the Hybridization Number problem on three binary phylogenetic trees on n leaves, which runs in time O(c k poly(n), with k the hybridization number of an optimal network and c some positive constant, and proves novel structural results that allow to reconstruct a network without having to guess the underlying topology.

A Simple Fixed Parameter Tractable Algorithm for Computing the Hybridization Number of Two (Not Necessarily Binary) Trees

Here, we present a new fixed parameter tractable algorithm to compute the hybridization number r of two rooted, not necessarily binary phylogenetic trees on taxon set X in time (6rr!) · poly(n),

Approximation Algorithms for Nonbinary Agreement Forests

The general, nonbinary version of maf has a polynomial-time 4-approximation and a fixed-parameter tractable (exact) algorithm that runs in O(4^k {\rm poly}(n) time, where $n=|X|$ and $k$ is the number of components of the agreement forest minus one.

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems

The fundamental problem of determining whether an unrooted phylogenetic network displays (i.e. embeds) a phylogenetic tree, is NP-hard and it is shown that the problem is FPT in the hybridization number, via kernelization, for any number of input trees.

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees

Using simulations, CycleKiller and NonbinaryCycleKiller are presented, the first methods to produce solutions verifiably close to optimality for instances with hundreds or even thousands of reticulations.



On the Complexity of Comparing Evolutionary Trees

Computing the minimum number of hybridization events for a consistent evolutionary history

Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable

This paper shows that the problem is fixed-parameter tractable in the two-tree instance when parameterized by this smallest number of reticulation vertices, which is NP-hard even when the collection consists of only two rooted binary phylogenetic trees.

A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

A simple and efficient approximation algorithm with performance ratio of at most 2 is presented, improving previous best bounds for either weighted or unweighted cases of the vertex cover problem.

Quantifying Hybridization in Realistic Time

A new fixed-parameter algorithm for computing the minimum number of hybridization events for when two rooted binary phylogenetic trees are given is given, based on interleaving-a technique using repeated kernelization steps that are applied throughout the exhaustive search part of a fixed- parameter algorithm.

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

A combinatorial algorithm that computes a (1+ɛ) approximation to the fractional optimal feedback vertex set, and a generalization of these problems, in which the feedback set has to intersect only a subset of the directed cycles in the graph.

Vertex cover might be hard to approximate to within 2-epsilon

Optimization, approximation, and complexity classes

A natural variant of NP, MAX NP, and also a subclass called MAX SNP are defined, which contain several natural, well-studied classes of optimization problems, and it is shown that problems in these classes can be approximated with some bounded error.

Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments

This work improves on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement Forest (MAAF) of a pair of phylogenetic trees and introduces new branching rules that reduce the running time of the algorithms.