A practical approximation algorithm for solving massive instances of hybridization number

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7534 LNBI, Issue , 2012, Pages 430-440

  Van Iersel, Leo ^a   Kelk, Steven ^b   Lekić, Nela ^b   Scornavacca, Celine ^c  

^a CWI   (Netherlands)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c INSTITUT DES SCIENCES DE L EVOLUTION   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY RELATIONSHIPS; HARD COMPUTATIONAL PROBLEM; HEURISTICS AND APPROXIMATIONS; OPTIMALITY; PHYLOGENETIC TREES;

BIOINFORMATICS; OPTIMIZATION;

APPROXIMATION ALGORITHMS;

EID: 84866648823     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33122-0_34     Document Type: Conference Paper

References (19)

1. Albrecht, B., Scornavacca, C., Cenci, A., Huson, D.H.: Fast computation of minimum hybridization networks. Bioinformatics 28(2), 191-197 (2012)
2. Baroni, M., Grünewald, S., Moulton, V., Semple, C.: Bounding the number of hybridisation events for a consistent evolutionary history. Mathematical Biology 51, 171-182 (2005)
3. Bordewich, M., Linz, S., St. John, K., Semple, C.: A reduction algorithm for computing the hybridization number of two trees. Evolutionary Bioinformatics 3, 86-98 (2007)
4. Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Applied Mathematics 155(8), 914-928 (2007)
5. Chen, Z.-Z., Wang, L.: Hybridnet: a tool for constructing hybridization networks. Bioinformatics 26(22), 2912-2913 (2010)
6. Chen, Z.-Z., Wang, L.: Algorithms for reticulate networks of multiple phylogenetic trees. IEEE/ACM Transactions on Computational Biology and Bioinformatics 9(2), 372-384 (2012)
7. Collins, J., Linz, S., Semple, C.: Quantifying hybridization in realistic time. Journal of Computational Biology 18, 1305-1318 (2011)
8. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)
9. Gascuel, O. (ed.): Mathematics of Evolution and Phylogeny. Oxford University Press, Inc. (2005)
10. Gascuel, O., Steel, M. (eds.): Reconstructing Evolution: New Mathematical and Computational Advances. Oxford University Press, USA (2007)
11. Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press (2011)
12. Huson, D.H., Scornavacca, C.: Dendroscope 3 - a program for computing and drawing rooted phylogenetic trees and networks (2011) (in preparation), Software, http://www.dendroscope.org
13. Huson, D.H., Scornavacca, C.: A survey of combinatorial methods for phylogenetic networks. Genome Biology and Evolution 3, 23-35 (2011)
14. Kelk, S.M., van Iersel, L.J.J., Lekić, N., Linz, S., Scornavacca, C., Stougie, L.: Cycle killer.. qu'est ce que c'est? on the comparative approximability of hybridization number and directed feedback vertex set. Submitted, preliminary version arXiv:1112.5359v1 (math.CO)
15. Nakhleh, L.: Evolutionary phylogenetic networks: models and issues. In: The Problem Solving Handbook for Computational Biology and Bioinformatics. Springer (2009)
16. Rodrigues, E.M., Sagot, M.F., Wakabayashi, Y.: The maximum agreement forest problem: Approximation algorithms and computational experiments. Theoretical Computer Science 374(1-3), 91-110 (2007)
17. Whidden, C.: http://kiwi.cs.dal.ca/Software/RSPR
18. Whidden, C., Beiko, R.G., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests. Submitted, preliminary version arXiv:1108.2664v1 (q-bio.PE)
19. Whidden, C., Beiko, R.G., Zeh, N.: Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 141-153. Springer, Heidelberg (2010)