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

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 problems in Karp's seminal 1972 list of 21 NP-complete problems. Despite considerable attention from the combinatorial optimization community, it remains to this day unknown whether a constant factor polynomial-time approximation exists for DFVS. Our result thus places the (in)approximability of hybridization number in a much broader complexity context, and as a consequence we obtain that it inherits inapproximability results from the problem Vertex Cover. On the positive side, we use results from the DFVS literatur...

[1]  R. Steele.  Optimization , 2005 .

[2]  Norbert Zeh,et al.  Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments , 2010, SEA.

[3]  Zhi-Zhong Chen,et al.  HybridNET: a tool for constructing hybridization networks , 2010, Bioinform..

[4]  Ramm,et al.  Fixed-Parameter Algorithms in Phylogenetics , 2007 .

[5]  Charles Semple,et al.  HYBRIDIZATION NETWORKS , 2014 .

[6]  Olivier Gascuel,et al.  Mathematics of Evolution and Phylogeny , 2005 .

[7]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

[8]  Charles Semple,et al.  A Framework for Representing Reticulate Evolution , 2005 .

[9]  M. Bordewich,et al.  Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable , 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[10]  Charles Semple,et al.  Note on the hybridization number and subtree distance in phylogenetics , 2009, Appl. Math. Lett..

[11]  Daniel H. Huson,et al.  Phylogenetic Networks - Concepts, Algorithms and Applications , 2011 .

[12]  Leo van Iersel,et al.  On the Elusiveness of Clusters , 2011, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[13]  Steven Kelk,et al.  Constructing Minimal Phylogenetic Networks from Softwired Clusters is Fixed Parameter Tractable , 2012, Algorithmica.

[14]  Charles Semple,et al.  A 3-approximation algorithm for the subtree distance between phylogenies , 2008, J. Discrete Algorithms.

[15]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[16]  Bruce A. Reed,et al.  Packing directed circuits , 1996, Comb..

[17]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[18]  Naren Ramakrishnan,et al.  Problem Solving Handbook in Computational Biology and Bioinformatics , 2010 .

[19]  Steven Kelk,et al.  When two trees go to war. , 2010, Journal of theoretical biology.

[20]  Charles Semple,et al.  Computing the minimum number of hybridization events for a consistent evolutionary history , 2007, Discret. Appl. Math..

[21]  Simone Linz,et al.  A Reduction Algorithm for Computing The Hybridization Number of Two Trees , 2007, Evolutionary bioinformatics online.

[22]  Katherine St. John,et al.  On the Complexity of uSPR Distance , 2010, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

[23]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[24]  Simone Linz,et al.  Quantifying Hybridization in Realistic Time , 2011, J. Comput. Biol..

[25]  Norbert Zeh,et al.  A Unifying View on Approximation and FPT of Agreement Forests , 2009, WABI.

[26]  Paul D. Seymour,et al.  Packing directed circuits fractionally , 1995, Comb..

[27]  Irit Dinur,et al.  The importance of being biased , 2002, STOC '02.

[28]  V. Moulton,et al.  Bounding the Number of Hybridisation Events for a Consistent Evolutionary History , 2005, Journal of mathematical biology.

[29]  L. Segal.  John , 2013, The Messianic Secret.

[30]  Barry O'Sullivan,et al.  A fixed-parameter algorithm for the directed feedback vertex set problem , 2008, JACM.

[31]  Olivier Gascuel,et al.  Reconstructing evolution : new mathematical and computational advances , 2007 .

[32]  Yoshiko Wakabayashi,et al.  The maximum agreement forest problem: Approximation algorithms and computational experiments , 2007, Theor. Comput. Sci..

[33]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[34]  L. Nakhleh.  Evolutionary Phylogenetic Networks: Models and Issues , 2010 .

[35]  Daniel H. Huson,et al.  Computing galled networks from real data , 2009, Bioinform..

[36]  J. Davenport.  Editor , 1960 .

[37]  Subhash Khot,et al.  Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[38]  Simone Linz,et al.  A First Step Toward Computing All Hybridization Networks For Two Rooted Binary Phylogenetic Trees , 2011, J. Comput. Biol..

[39]  Joseph Naor,et al.  Approximating Minimum Feedback Sets and Multicuts in Directed Graphs , 1998, Algorithmica.

[40]  Tao Jiang,et al.  On the Complexity of Comparing Evolutionary Trees , 1996, Discret. Appl. Math..

[41]  D. Huson,et al.  A Survey of Combinatorial Methods for Phylogenetic Networks , 2010, Genome biology and evolution.

[42]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[43]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .