Phylogenetic networks do not need to be complex: Using fewer reticulations to represent conflicting clusters

Bioinformatics

Volumn 26, Issue 12, 2010, Pages

  van Iersel, Leo ^a   Kelk, Steven ^b   Rupp, Regula ^c   Huson, Daniel ^c  

^a UNIVERSITY OF CANTERBURY   (New Zealand)

^b CWI   (Netherlands)

^c UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CLUSTER ANALYSIS; MOLECULAR EVOLUTION; PHYLOGENY;

ALGORITHMS; CLUSTER ANALYSIS; EVOLUTION, MOLECULAR; PHYLOGENY;

EID: 77954178859     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq202     Document Type: Article

References (22)

1. Bordewich, M. and Semple, C. (2007) Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Appl. Math., 155, 914-928.
2. Bordewich, M. et al. (2007) A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinform., 3, 86-98.
3. Choy, C. et al. (2005) Computing the maximum agreement of phylogenetic networks. Theor. Comput. Sci., 335, 93-107.
4. Gambette, P. (2009) Who's who in phylogenetic networks, 2009. Available at http://www.lirmm.fr/~gambette/PhylogeneticNetworks/ (last accessed date April 24, 2010).
5. Grass Phylogeny Working Group (2001) Phylogeny and subfamilial classification of the grasses (Poaceae). Ann. Mo. Bot. Gard., 88, 373-457.
6. Gusfield, D. et al. (2007a) A decomposition theory for phylogenetic networks and incompatible characters. J. Comput. Biol., 14, 1247-1272.
7. Gusfield, D. et al. (2007b) An efficiently computed lower bound on the number of recombinations in phylogenetic networks: theory and empirical study. Discrete Appl. Math., 155, 806-830.
8. Huson, D.H. and Klöpper, T.H. (2007) Beyond galled trees decomposition and computation of galled networks. In Research in Computational Molecular Biology (RECOMB), Vol. 4453 of Lecture Notes in Computer Science, Springer, Berlin, pp. 221-225.
9. Huson, D.H. and Rupp, R. (2008) Summarizing multiple gene trees using cluster networks. In Algorithms in Bioinformatics (WABI), Vol. 5251 of Lecture Notes in Bioinformatics, Springer, Berlin, pp. 296-305.
10. Huson, D.H. et al. (2007) Dendroscope: an interactive viewer for large phylogenetic trees. BMC Bioinformatics, 8, 460.
11. Huson, D.H. et al. (2009) Computing galled networks from real data. Bioinformatics, 25, i85-i93.
12. Huynh, T. et al. (2005) Constructing a smallest refining galled phylogenetic network. In Research in Computational Molecular Biology (RECOMB), Vol. 3500 of Lecture Notes in Bioinformatics, Springer, Berlin, pp. 265-280.
13. Jansson, J. and Sung, W.-K. (2006) Inferring a level-1 phylogenetic network from a dense set of rooted triplets. Theor. Comp. Sci., 363, 60-68.
14. Jansson, J. et al. (2006) Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM J. Comput., 35, 1098-1121.
15. Linz, S. and Semple, C. (2009) Hybridisation in nonbinary trees. IEEE/ACM Trans. Comput. Biol. Bioinform., 6, 30-45.
16. Nakleh, L. (2009) Evolutionary phylogenetic networks: models and issues. In Heath, L. and Ramakrishnan, N. (eds), The Problem Solving Handbook for Computational Biology and Bionformatics, Springer.
17. Schmidt, H.A. (2003) Phylogenetic trees from large datasets. PhD Thesis, Heinrich-Heine-Universität, Düsseldorf.
18. Semple, C. (2007) Hybridization networks. In Gascuel, O. and Steel, M. (eds), Reconstructing Evolution - New Mathematical and Computational Advances, Oxford University Press, pp. 277-314.
19. To, T.-H. and Habib, M. (2009) Level-k phylogenetic networks are constructable from a dense triplet set in polynomial time. In Combinatorial Pattern Matching (CPM), Vol. 5577 of Lecture Notes in Computer Science, pp. 275-288.
20. van Iersel, L.J.J. and Kelk, S.M. (2009) Constructing the simplest possible phylogenetic network from triplets. Algorithmica [Epub ahead of print, doi:10.1007/s00453-009-9333-0, July 7, 2009].
21. van Iersel, L.J.J. et al. (2009a) Constructing level-2 phylogenetic networks from triplets. IEEE/ACM Trans. Comput. Biol. Bioinform., 6, 667-681.
22. van Iersel, L.J.J. et al. (2009b) Cass: Combining phylogenetic trees into a phylogenetic network, Available at http://sites.google.com/site/cassalgorithm/ (last accessed date April 24, 2010).