A first step toward computing all hybridization networks for two rooted binary phylogenetic trees

Journal of Computational Biology

Volumn 19, Issue 11, 2012, Pages 1227-1242

  Scornavacca, Celine ^a   Linz, Simone ^b   Albrecht, Benjamin ^c  

^a INSTITUT DES SCIENCES DE L EVOLUTION   (France)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

^c UNIVERSITY OF MUNICH   (Germany)

Author keywords

bounded search; directed acyclic graphs; hybridization; maximum acyclic agreement forests; phylogenetics

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; COMPUTER SIMULATION; PHYLOGENY; THEORETICAL MODEL;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; MODELS, THEORETICAL; PHYLOGENY;

EID: 84868640873     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2012.0192     Document Type: Article

References (17)

1. Albrecht, B. 2011. Fast computation of hybridization networks [MSc thesis]. University of Tübingen, Germany.
2. Albrecht, B., Scornavacca, C., Cenci, A., et al. 2012. Fast computation of minimum hybridization networks. Bioinformatics. 28, 191-197.
3. Baroni, M., Grünewald, S., Moulton, V., et al. 2005. Bounding the number of hybridisation events for a consistent evolutionary history. J.Math. Biol. 51, 171-182.
4. Baroni, M., Semple, C., and Steel, M. 2006. Hybrids in real time. Syst. Biol. 55, 46-56.
5. Bordewich, M., and Semple, C. 2007a. Computing the hybridization number of two phylogenetic trees is fixedparameter tractable. IEEE Trans. Comput. Biol. Bioinf. 4, 458-466.
6. Bordewich, M.and Semple, C. 2007b. Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Appl. Math. 155, 914-928.
7. Chen, Z.Z., and Wang, L. 2010. HybridNET: A tool for constructing hybridization networks. Bioinformatics. 26, 2912-2913.
8. Collins, J., Linz, S., and Semple, C. 2011. Quantifying hybridization in realistic time. J.of Comp. Biol. 18, 1305-1318.
9. Huson, D.H., and Scornavacca, C. 2011. A survey of combinatorial methods for phylogenetic networks. Genome Biol. Evol. 3, 23-35.
10. Huson, D.H., Richter, D.C., Rausch, C., et al. 2007. Dendroscope: An interactive viewer for large phylogenetic trees. BMC Bioinformatics. 8, 460.
11. Huson, D.H., Rupp, R., and Scornavacca, C. 2011. Phylogenetic Networks: Concepts, Algorithms and Applications. Cambridge University Press, New York.
12. Kelk, S., van Iersel, L., Lekic, N., et al. 2012. Cycle killer. qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set. SIAM J.Discrete Math., in press.
13. Semple, C. 2007. Hybridization networks, 277-314. In Gascuel, O., and Steel, M., eds. Reconstructing Evolution - New Mathematical and Computational Advances, Oxford University Press, New York.
14. Semple, C., and Steel, M. 2003. Phylogenetics. Oxford University Press, New York.
15. Whidden, C., and Zeh, N. 2009. A unifying view on approximation and fpt of agreement forests, 390-402. In Salzberg, S., and Warnow, T.eds., Lecture Notes in Computer Science, Vol. 5724. Springer, New York.
16. Whidden, C., Beiko, R., and Zeh, N. 2010. Fast FPT algorithms for computing rooted agreement forests: Theory and experiments, 141-153. In Proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010. Lecture Notes in Computer Science, Vol. 6049, Springer, New York.
17. Whidden, C., Beiko, R.G., and Zeh, N. 2011. Fixed-parameter and approximation algorithms for maximum agreement forests. Available at: http://arxiv.org/abs/1108.2664v1. Accessed August 2012.