Fast computation of the exact hybridization number of two phylogenetic trees

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

Volumn 6053 LNBI, Issue , 2010, Pages 203-214

  Wu, Yufeng ^a   Wang, Jiayin ^a  

^a University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY HISTORY; EVOLUTIONARY PROCESS; EXISTING METHOD; FAST COMPUTATION; INTEGER LINEAR PROGRAMMING FORMULATION; NP-HARD; PHYLOGENETIC TREES; PRACTICAL METHOD; SIMULATED DATASETS; SIMULATION RESULT;

INTEGER PROGRAMMING; LINEARIZATION;

BIOINFORMATICS;

EID: 77953759624     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13078-6_23     Document Type: Conference Paper

References (20)

1. Baroni, M., Grunewald, S., Moulton, V., Semple, C.: Bounding the number of hybridization events for a consistent evolutionary history. J. Math. Biol. 51, 171-182 (2005)
2. Baroni, M., Semple, C., Steel, M.: A framework for representing reticulate evolution. Annals of Combinatorics 8, 391-408 (2004)
3. Beiko, R.G., Hamilton, N.: Phylogenetic identification of lateral genetic transfer events. BMC Evolutionary Biology 6, 15 (2006)
4. Bonet, M., John, K.S., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. J. of Comp. Biology 13, 1419-1434 (2006)
5. Bordewich, M., Linz, S., John, K.S., Semple, C.: A reduction algorithm for computing the hybridization number of two trees. Evolutionary Bioinformatics 3, 86-98 (2007)
6. Bordewich, M., McCartin, C., Semple, C.: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6, 458-471 (2008)
7. Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8, 409-423 (2004)
8. Bordewich, M., Semple, C.: Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Applied Mathematics 155, 914-928 (2007)
9. Grass Phylogeny Working Group. Phylogeny and subfamilial classification of the grasses (poaceae). Ann. Mo. Bot. Gard. 88, 373-457 (2001)
10. Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Appl. Math 71, 153-169 (1996)
11. Huson, D., Bryant, D.: Application of phylogenetic networks in evolutionary studies. Molecular Biology and Evolution 23, 254-267 (2006)
12. Linder, C.R., Moret, B.M.E., Nakhleh, L., Warnow, T.: Network (reticulate) evolution: biology, models, and algorithms (2004)
13. Linz, S.: Personal communications
14. Linz, S., Semple, C.: Hybridization in nonbinary trees. IEEE/ACM Transactions on Computational Biology and Bioinformatics 6, 30-45 (2009)
15. Nakhleh, L.: Evolutionary phylogenetic networks: models and issues. In: Heath, L., Ramakrishnan, N. (eds.) The Problem Solving Handbook for Computational Biology and Bioinformatics. Springer, Heidelberg (In press 2010)
16. Rodrigues, E.M., Sagot, M.F., Wakabayashi, Y.: Some approximation results for the maximum agreement forest problem. In: Proceedings of RANDOM-APPROX 2001, pp. 159-169 (2001)
17. Schmidt, H.: Phylogenetic trees from large datasets. PhD thesis, Heinrich-Heine- Universität, Düsseldorf (2003)
18. Semple, C.: Hybridization networks. In: Gascuel, O., Steel, M. (eds.) Reconstructing Evolution: New Mathematical and Computational Advances, Oxford, pp. 277-309 (2007)
19. Tarjan, R.: Enumeration of the elementary circuits of a directed graph. SIAM J. on Computing 2, 211-216 (1973)
20. Wu, Y.: A practical method for exact computation of subtree prune and regraft distance. Bioinformatics 25, 190-196 (2009)