Approximation algorithms for nonbinary agreement forests

SIAM Journal on Discrete Mathematics

Volumn 28, Issue 1, 2014, Pages 49-66

  Van Iersel, Leo ^a   Kelk, Steven ^b   Lekić, Nela ^b   Stougie, Leen ^a,c  

^a CWI   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Agreement forests; Approximation algorithm; Fixed parameter tractability; Phylogenetic network; Phylogenetic tree

Indexed keywords

BINARY TREES; BIOINFORMATICS; FORESTRY; POLYNOMIAL APPROXIMATION;

C-APPROXIMATION ALGORITHMS; CLASSICAL PROBLEMS; FEEDBACK VERTEX SET; FIXED-PARAMETER TRACTABILITY; NUMBER OF COMPONENTS; PHYLOGENETIC NETWORKS; PHYLOGENETIC TREES; POLYNOMIAL-TIME;

APPROXIMATION ALGORITHMS;

EID: 84898885151     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/120903567     Document Type: Article

References (31)

1. M. Baroni, S. Gr?unewald, V. Moulton, and C. Semple, Bounding the number of hybridisation events for a consistent evolutionary history, J. Math. Biol., 51 (2005), pp. 171-182
2. M. Baroni, C. Semple, and M. Steel, A framework for representing reticulate evolution, Ann. Combin., 8 (2004), pp. 391-408
3. M. L. Bonet, K. St. John, R. Mahindru, and N. Amenta, Approximating subtree distances between phylogenies, J. Comput. Biol., 13 (2006), pp. 1419-1434
4. M. Bordewich, S. Linz, K. St. John, and C. Semple, A reduction algorithm for computing the hybridization number of two trees, Evolutionary Bioinform., 3 (2007), pp. 86-98
5. 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
6. M. Bordewich and C. Semple, On the computational complexity of the rooted subtree prune and regraft distance, Ann. Combin., 8 (2005), pp. 409-423
7. M. Bordewich and C. Semple, Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable, IEEE/ACM Trans. Comput. Biol. Bioinform., 4 (2007), pp. 458-466
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
9. F. Chataigner, Approximating the maximum agreement forest on k trees, Inform. Process. Lett., 93 (2005), pp. 239-244
10. Z-Z. Chen and L. Wang, Hybridnet: A tool for constructing hybridization networks, Bioinform., 26 (2010), pp. 2912-2913
11. J. Collins, Rekernelisation Algorithms in Hybrid Phylogenies, MSc. thesis, University of Canterbury, Christchurch, New Zealand, 2009
12. J. Collins, S. Linz, and C. Semple, Quantifying hybridization in realistic time, J. Comput. Biol., 18 (2011), pp. 1305-1318
13. G. Even, J. Naor, B. Schieber, and M. Sudan, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20 (1998), pp. 151-174
14. J. Flum and M. Grohe, Parameterized Complexity Theory, Springer, New York, 2006
15. O. Gascuel, ed., Mathematics of Evolution and Phylogeny, Oxford University Press, Oxford, UK, 2005
16. O. Gascuel and M. Steel, eds., Reconstructing Evolution: New Mathematical and Computational Advances, Oxford University Press, Oxford, UK, 2007
17. J. Hein, T. Jiang, L. Wang, and K. Zhang, On the complexity of comparing evolutionary trees, Discrete Appl. Math., 71 (1996), pp. 153-169
18. D. H. Huson, R. Rupp, and C. Scornavacca, Phylogenetic Networks: Concepts, Algorithms and Applications, Cambridge University Press, Cambridge, UK, 2010
19. L. J. J. van Iersel, S. M. Kelk, N. Leki'c, and C. Scornavacca, A practical approximation algorithm for solving massive instances of hybridization number, in Algorithms in Bioinformatics, Lecture Notes in Comput. Sci. 7534, B. Raphael and J. Tang, eds. Springer, New York, 2012, pp. 430-440
20. L. J. J. van Iersel, S. M. Kelk, N. Leki'c, and L. Stougie, MAF: Maximum Agreement Forests for Nonbinary Trees, 2012. Software available online at http://homepages.cwi.nl/?iersel/MAF/
21. S. Kelk, L. van Iersel, N. Leki'c, S. Linz, C. Scornavacca, and L. Stougie, Cycle killer...qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set, SIAM J. Discrete Math., 26 (2012), pp. 1635-1656
22. S. Linz and C. Semple, Hybridization in non-binary trees, IEEE/ACM Trans. Comput. Biol. Bioinform., 6 (2009), pp. 30-45
23. D. A. Morrison, An Introduction to Phylogenetic Networks, RJR Productions, 2011. Available online at http://www.rjr-productions.org/Networks/
24. L. Nakhleh, Evolutionary phylogenetic networks: Models and issues, in The Problem Solving Handbook for Computational Biology and Bioinformatics, Springer, New York, 2009, pp. 125-158
25. R. Niedermeier, Invitation to Fixed-Parameter Algorithms, Oxford Lecture Ser. Math. Appl. 31, Oxford University Press, Oxford, UK, 2006
26. T. Piovesan and S. M. Kelk, A simple fixed parameter tractable algorithm for computing the hybridization number of two (not necessarily binary) trees, IEEE/ACM Trans. Comput. Biol. Bioinform., 10 (2013), pp. 18-25
27. E. M. Rodrigues, M.-F. Sagot, and Y. Wakabayashi, The maximum agreement forest problem: Approximation algorithms and computational experiments, Theoret. Comput. Sci., 374 (2007), pp. 91-110
28. C. Scornavacca, S. Linz, and B. Albrecht, A first step towards computing all hybridization networks for two rooted binary phylogenetic trees, J. Comput. Biol., 19 (2012), pp. 1227- 1242
29. C. Semple and M. Steel, Phylogenetics, Oxford University Press, Oxford, UK, 2003
30. C. Whidden, R. G. Beiko, and N. Zeh, Fixed-Parameter and Approximation Algorithms for Maximum Agreement Forests, preprint, arXiv:1108.2664v1 [q-bio.PE], 2011
31. C. Whidden, R. G. Beiko, and N. Zeh, Fixed-parameter algorithms for maximum agreement forests, SIAM J. Comput., 42 (2013), pp. 1431-1466