Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees

Bioinformatics

Volumn 26, Issue 12, 2010, Pages

  Wu, Yufeng ^a  

^a University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGY; METHODOLOGY; MOLECULAR EVOLUTION; PHYLOGENY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; EVOLUTION, MOLECULAR; PHYLOGENY;

EID: 77954180873     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq198     Document Type: Article

References (24)

1. Baroni,M. et al. (2005) Bounding the number of hybridisation events for a consistent evolutionary history. J. Math. Biol., 51, 171-182.
2. Baroni,M. et al. (2004) A framework for representing reticulate evolution. Ann. Comb., 8, 391-408.
3. Bordewich,M. et al. (2007) A reduction algorithm for computing the hybridization number of two trees. Evol. Bioinform., 3, 86-98.
4. Bordewich,M. and Semple,C. (2004) On the computational complexity of the rooted subtree prune and regraft distance. Ann. Comb., 8, 409-423.
5. Bordewich,M. and Semple,C. (2007) Computing the minimum number of hybridization events for a consistent evolutionary history. Dis. Appl. Math., 155, 914-928.
6. Grass Phylogeny Working Group (2001) Phylogeny and subfamilial classification of the grasses (poaceae). Ann. Mo. Bot. Gard., 88, 373-457.
7. Gusfield,D. (2005) Optimal, efficient reconstruction of Root-Unknown phylogenetic networks with constrained and structured recombination. J. Comput. Syst, Sci., 70. 381-398.
8. Hallett,M. and Lagergren,J. (2001) Efficient algorithms for lateral gene transfer problems. In Proceedings of FifthAnnual Conference on Research in Computational Molecular Biology (RECOMB 2001), ACM, New York, NY, USA, pp. 149-156.
9. Hein,J. et al. (1996) On the complexity of comparing evolutionary trees. Dis. Appl. Math., 71, 153-169.
10. Hudson,R. (2002) Generating samples under the Wright-Fisher neutral model of genetic variation. Bioinformatics, 18, 337-338.
11. Huson,D. (2007) Split networks and reticulate networks. In Gascuel,O. and Steel,M. (eds), Reconstructing Evolution: New Mathematical and Computational Advances. Oxford University Press, Oxford, UK, pp. 247-276.
12. Huson,D. and Bryant,D. (2006) Application of phylogenetic networks in evolutionary studies. Mol. Biol. Evol., 23, 254-267.
13. Huson,D. and Klopper,T. (2007) Beyond galled trees -decomposition and computation of galled networks. In Speed,T. and Huang,H. (eds), Proceeding of RECOMB 2007: The 11th Annual International Conference Research in Computational Molecular Biology. Vol. 4453 of LNBI, Springer, Berlin/Heidelberg, pp. 211-225.
14. Huson,D. et al. (2005) Reconstruction of reticulate networks from gene trees. In Proceeding of RECOMB 2005: The 9th Annual International Conference Research in Computational Molecular Biology. Vol. 3500 of LNBI, Springer, Berlin/Heidelberg, pp. 233-249.
15. Huson,D. et al. (2009) Computing galled networks from real data. Bioinformatics, 25, i85-i93.
16. Linz,S. and Semple,C. (2009) Hybridization in nonbinary trees. IEEE/ACM Trans. Comput. Biol. Bioinform., 6, 30-45
17. Nakhleh,L. (2009) Evolutionary phylogenetic networks: models and issues. In Heath,L. and Ramakrishnan,N. (eds), The Problem Solving Handbook for Computational Biology and Bioinformatics. Springer, New York Inc, New York, USA.
18. Nakhleh,L. et al. (2004) Reconstructing reticulate evolution in species -theory and practice. In Proceeding of 8th Annual International Conference on Computational Molecular Biology, Springer, Berlin/Heidelberg, pp. 337-346.
19. Nakhleh,L. et al. (2005) Reconstructing reticulate evolution in species -theory and practice. J. Comp. Biol., 12, 796-811.
20. Schmidt,H. (2003) Phylogenetic trees from large datasets. PhD Thesis, Heinrich-Heine-Universitat, Dusseldorf.
21. Semple,C. (2007) Hybridization networks. In Gascuel,O. and Steel,M. (eds), Reconstructing Evolution: New Mathematical and Computational Advances. Oxford University Press, Oxford, pp. 277-309.
22. van Iersel,L. et al. (2008) Constructing level-2 phylogenetic networks from triplets. In Vingron,M. and Wong,L. (eds), Proceeding of RECOMB 2008: The 12th Annual International Conference Research in Computational Molecular Biology. Vol. 4955 of LNBI, Springer, Berlin/Heidelberg, pp. 450-462.
23. Wu,Y. (2009) A practical method for exact computation of subtree prune and regraft distance. Bioinformatics, 25, 190-196.
24. Wu,Y. and Wang,J. (2010) Fast Computation of the exact hybridization number of two phylogenetic trees. In Borodovsky,M. et al. (eds) Proceeding of ISBRA 2010: The 6th International Symposium on Bioinformatics Research and Applications, Vol. 6053 of Lecture Notes in Bioinformatics, Springer, Berlin/Heidelberg, pp. 203-214.