A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number
Reticulate events play an important role in determining evolutionary relationships. The problem of computing the minimum number of such events to explain discordance between two phylogenetic trees is a hard computational problem. In practice, exact solvers struggle to solve instances with reticulation number larger than 40. For such instances, one has to resort to heuristics and approximation algorithms. Here we present the algorithm CycleKiller which is the first approximation algorithm that can produce solutions verifiably close to optimality for instances with hundreds or even thousands of reticulations. Theoretically, the algorithm is an exponential-time 2-approximation (or 4-approximation in its fastest mode). However, using simulations we demonstrate that in practice the algorithm runs quickly for large and difficult instances, producing solutions within one percent of optimality. An implementation of this algorithm, which extends the theoretical work of , has been made publicly available.
KeywordsPhylogenetic Network Massive Instance Agreement Forest Hybridization Number Binary Phylogenetic Tree
Unable to display preview. Download preview PDF.
- 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)Google Scholar
- 8.Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)Google Scholar
- 9.Gascuel, O. (ed.): Mathematics of Evolution and Phylogeny. Oxford University Press, Inc. (2005)Google Scholar
- 11.Huson, D.H., Rupp, R., Scornavacca, C.: Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press (2011)Google Scholar
- 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
- 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)Google Scholar
- 15.Nakhleh, L.: Evolutionary phylogenetic networks: models and issues. In: The Problem Solving Handbook for Computational Biology and Bioinformatics. Springer (2009)Google Scholar
- 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)Google Scholar