Cycle killer⋯ qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set

SIAM Journal on Discrete Mathematics

Volumn 26, Issue 4, 2012, Pages 1635-1656

  Kelk, Steven ^a   Van Iersel, Leo ^b   Lekić, Nela ^a   Linz, Simone ^c   Scornavacca, Celine ^d   Stougie, Leen ^e  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b CWI   (Netherlands)

^c UNIVERSITY OF TÜBINGEN   (Germany)

^d INSTITUT DES SCIENCES DE L EVOLUTION   (France)

^e VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Approximation; Directed feedback vertex set; Hybridization number; Phylogenetic networks

Indexed keywords

APPROXIMABILITY; APPROXIMATION; CONSTANT FACTORS; DIRECTED ACYCLIC GRAPH (DAG); FEEDBACK VERTEX SET; HYBRIDIZATION NUMBER; INAPPROXIMABILITY; PHYLOGENETIC NETWORKS; PHYLOGENETIC TREES; POLYNOMIAL TIME APPROXIMATION; VERTEX COVER;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; DIRECTED GRAPHS;

POLYNOMIAL APPROXIMATION;

EID: 84871559037     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/120864350     Document Type: Article

References (41)

1. V. BAFNA, P. BERMAN, AND T. FUJITO, A 2-approximatio n algorithm for the undirected feedback vertex set problem, SIAM J. Discrete Math., 12(1999), pp. 289-297. (Pubitemid 129643163)
2. M. BARONI, S. GRÜNEWALD, V. MOULTON, AND C. SEMPLE, Bounding the number of hybridisation events for a consistent evolutionary history, J. Math. Biol., 51(2005), pp. 171-182. (Pubitemid 41040209)
3. M. BARONI, C. SEMPLE, AND M. STEEL, A framework for representing reticulate evolution, Ann. Comb., 8(2004), pp. 391-408. (Pubitemid 40167161)
4. M. BONET AND K. S. JOHN, On the complexity of uSPR distance, IEEE/ACM Trans. Comput. Biol. Bioinformatics, 7(2010), pp. 572-576.
5. M. BORDEWICH, S. LINZ, K. S. JOHN, AND C. SEMPLE, A reduction algorithm for computing the hybridization number of two trees, Evolutionary Bioinformatics, 3(2007), pp. 86-98.
6. M. BORDEWICH, C. MCCARTIN, AND C. SEMPLE, A 3-approximation algorithm for the subtree distance between phylogenies, J. Discrete Algorithms, 6(2008), pp. 458-471.
7. M. BORDEWICH AND C. SEMPLE, Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable, IEEE/ACM Trans. Comput. Biol. Bioinformatics, 4(2007), pp. 458-466. (Pubitemid 47274721)
8. M. BORDEWICH AND C. SEMPLE, Computing the minimum number of hybridization events for a consistent evolutionary history, Discrete Appl. Math., 155(2007), pp. 914-928. (Pubitemid 46436152)
9. J. CHEN, Y. LIU, S. LU, B. O'SULLIVAN, AND I. RAZGON, A fixed-parameter algorithm for the directed feedback vertex set problem, J. ACM, 55(2008), 21.
10. Z.-Z. CHEN AND L. WANG, Hybridnet: a tool for constructing hybridization networks, Bioinformatics, 26(2010), pp. 2912-2913.
11. J. COLLINS, S. LINZ, AND C. SEMPLE, Quantifying hybridization in realistic time, J. Comput. Biol., 18(2011), pp. 1305-1318.
12. I. DINUR AND S. SAFRA, The importance of being biased, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC'02), ACM, New York, 2002, pp. 33-42. (Pubitemid 35009358)
13. I. DINUR AND S. SAFRA, On the hardness of approximating minimum vertex cover, Ann. of Math. (2), 162(2004), pp. 439-485.
14. R. G. DOWNEY AND M. R. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
15. G. EVEN, J. NAOR, B. SCHIEBER, AND M. SUDAN, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20(1998), pp. 151-174. (Pubitemid 128663382)
16. J. FLUM AND M. GROHE, Parameterized Complexity Theory, Springer-Verlag, Berlin, 2006.
17. O. GASCUEL, ed., Mathematics of Evolution and Phylogeny, Oxford University Press, Oxford, 2005.
18. O. GASCUEL AND M. STEEL, eds., Reconstructing Evolution: New Mathematical and Computational Advances, Oxford University Press, New York, 2007.
19. J. GRAMM, A. NICKELSEN, AND T. TANTAU, Fixed-parameter algorithms in phylogenetics, The Computer J., 51(2008), pp. 79-101.
20. J. HEIN, T. JING, L. WANG, AND K. ZHANG, On the complexity of comparing evolutionary trees, Discrete Appl. Math., 71(1996), pp. 153-169. (Pubitemid 126391777)
21. P. J. HUMPHRIES AND C. SEMPLE, Note on the hybridization number and subtree distance in phylogenetics, Appl. Math. Lett., 22(2009), pp. 611-615.
22. D. H. HUSON, R. RUPP, V. BERRY, P. GAMBETTE, AND C. PAUL, Computing galled networks from real data, Bioinformatics, 25(2009), pp. i85-i93.
23. D. H. HUSON, R. RUPP, AND C. SCORNAVACCA, Phylogenetic Networks: Concepts, Algorithms and Applications, Cambridge University Press, Cambridge, UK, 2010.
24. D. H. HUSON AND C. SCORNAVACCA, A survey of combinatorial methods for phylogenetic networks, Genome Biology and Evolution, 3(2011), pp. 23-35.
25. V. KANN, On the Approximability of NP-Complete Optimization Problems, Ph. D. thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, 1992.
26. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, 1972), Plenum, New York, 1972, pp. 85-103.
27. S. M. KELK AND C. SCORNAVACCA, Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable, preprint, 2011; http://arxiv.org/abs/1108.3653.
28. S. M. KELK, C. SCORNAVACCA, AND L. J. J. VAN IERSEL, On the elusiveness of clusters, IEEE/ACM Trans. Comput. Biol. Bioinformatics, 9(2012), pp. 517-534.
29. S. KHOT AND O. REGEV, Vertex cover might be hard to approximate to within 2-e, J. Comput. System Sci., 74(2008), pp. 335-349.
30. L. NAKHLEH, Evolutionary phylogenetic networks: Models and issues, in The Problem Solving Handbook for Computational Biology and Bioinformatics, Springer-Verlag, New York, 2009.
31. R. NIEDERMEIER, Invitation to Fixed Parameter Algorithms (Oxford Lecture Series in Mathematics and Its Applications), Oxford University Press, New York, 2006.
32. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, J. Comput. System Sci., 43(1991), pp. 425-440.
33. E. RODRIGUES, M. SAGOT, AND Y. WAKABAYASHI, The maximum agreement forest problem: Approximation algorithms and computational experiments, Theoret. Comput. Sci., 374(2007), pp. 91-110. (Pubitemid 46452973)
34. C. SCORNAVACCA, S. LINZ, AND B. ALBRECHT, A first step towards computing all hybridization networks for two rooted binary phylogenetic trees, J. Comput. Biol., to appear.
35. C. SEMPLE, Hybridization networks, in Reconstructing Evolution: New Mathematical and Computational Advances, Oxford University Press, New York, 2007.
36. C. SEMPLE AND M. STEEL, Phylogenetics, Oxford University Press, Oxford, 2003.
37. P. D. SEYMOUR, Packing directed circuits fractionally, Combinatorica, 15(1995), pp. 281-288.
38. L. J. J. VAN IERSEL AND S. M. KELK, When two trees go to war, J. Theoret. Biol., 269(2011), pp. 245-255.
39. C. WHIDDEN, R. BEIKO, AND N. ZEH, Fast FPT algorithms for computing rooted agreement forests: Theory and experiments, in Proceedings of the 9th International Symposium on Experimental Algorithms (SEA 2010), Lecture Notes in Comput. Sci. 6049, Springer-Verlag, Berlin, 2010, pp. 141-153.
40. C. WHIDDEN, R. G. BEIKO, AND N. ZEH, Fixed-parameter and approximation algorithms for maximum agreement forests, preprint, 2011, http://arxiv.org/abs/ 1108.2664.
41. C. WHIDDEN AND N. ZEH, A unifying view on approximation and FPT of agreement forests, in Algorithms in Bioinformatics, S. Salzberg and T. Warnow, eds., Lecture Notes in Comput. Sci. 5724, Springer-Verlag, Berlin, 2009, pp. 390-402.