Computing the minimum number of hybridization events for a consistent evolutionary history

Discrete Applied Mathematics

Volumn 155, Issue 8, 2007, Pages 914-928

  Bordewich, Magnus ^a   Semple, Charles ^b  

^a DURHAM UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Agreement forest; Hybrid phylogeny; Phylogenetic network; Reticulate evolution; Rooted phylogenetic tree; Rooted subtree prune and regraft

Indexed keywords

BINARY SEQUENCES; COMPUTATION THEORY; EVOLUTIONARY ALGORITHMS; TREES (MATHEMATICS);

AGREEMENT FOREST; HYBRID PHYLOGENY; PHYLOGENETIC NETWORK; RETICULATE EVOLUTION; ROOTED PHYLOGENETIC TREE; ROOTED SUBTREE PRUNE AND REGRAFT;

NUMBER THEORY;

EID: 33947231094     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.08.008     Document Type: Article

References (20)

1. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation (1999), Springer, Berlin
2. Baroni M., Grünewald S., Moulton V., and Semple C. Bounding the number of hybridization events for a consistent evolutionary history. J. Math. Biol. 51 (2005) 171-182
3. Baroni M., Semple C., and Steel M. A framework for representing reticulate evolution. Ann. Combin. 8 (2004) 391-408
4. M.K. Bonet, K. St. John, R. Mahindru, N. Amenta, Approximating subtree distances between phylogenies, Technical Report #669, Centre de Recerca Matematica, Barcelona, 2006.
5. Bordewich M., and Semple C. On the computational complexity of the rooted subtree prune and regraft distance. Ann. Combin. 8 (2004) 409-423
6. Chlebík M., and Chlebíková J. Inapproximability results for bounded variants of optimization problems. In: Lingas A., and Nilsson B.J. (Eds). Fundamentals of Computation Theory, 14th International Symposium (FCT), Lecture Notes in Computer Science vol. 2751 (2003), Springer-Verlag 27-38
7. S. Grünewald, Private communication.
8. Gusfield D., Eddhu S., and Langley C. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinform. Comput. Biol. 2 (2004) 173-213
9. E. Hazan, S. Safra, O. Schwartz, On the hardness of approximating k-dimensional matching, ECCC Report TR03-20, 2003.
10. Hein J. Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98 (1990) 185-200
11. Hein J., Jing T., Wang L., and Zhang K. On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71 (1996) 153-169
12. Kann V. Maximum bounded 3-dimensional matching is MAX SNP-complete. Inform. Process. Lett. 37 (1991) 27-35
13. Maddison W. Gene trees in species trees. Systematic Biol. 46 (1997) 523-536
14. Nakhleh L., Warnow T., Randal Linder C., and John K.St. Reconstructing reticulate evolution in species-theory and practice. J. Comput. Biol. 12 (2005) 796-811
15. Papadimitriou C.H., and Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 (1991) 425-440
16. Rodrigues E.M., Sagot M.-F., and Wakabayashi Y. Some approximation results for the maximum agreement forest problem. In: Goemans M., et al. (Ed). Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (APPROX and RANDOM) (2001), Lecture Notes in Computer Science, vol. 2129, Springer, Berlin 159-169
17. Semple C., and Steel M. Phylogenetics (2003), Oxford University Press, Oxford
18. Song Y., and Hein J. Parsimonious reconstruction of sequence evolution and haplotyde blocks: finding the minimum number of recombination events. In: Benson G., and Page R. (Eds). Algorithms in Bioinformatics (WABI), Lecture Notes in Bioinformatics vol. 2812 (2003), Springer, Berlin 287-302
19. Song Y., and Hein J. Constructing minimal ancestral recombination graphs. J. Comput. Biol. 12 (2005) 147-169
20. Wang L., Zhang K., and Zhang L. Perfect phylogenetic networks with recombination. J. Comput. Biol. 8 (2001) 69-78