This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable
July-September 2007 (vol. 4 no. 3)
pp. 458-466
Reticulation processes in evolution mean that the ancestral history of certain groups of present-day species is non-tree-like. These processes include hybridization, lateral gene transfer, and recombination. Despite the existence of reticulation, such events are relatively rare and so a fundamental problem for biologists is the following: given a collection of rooted binary phylogenetic trees on sets of species that correctly represent the tree-like evolution of different parts of their genomes, what is the smallest number of "reticulation" vertices in any network that explains the evolution of the species under consideration. It has been previously shown that this problem is NP-hard even when the collection consists of only two rooted binary phylogenetic trees. However, in this paper, we show that the problem is fixed-parameter tractable in the two-tree instance, when parameterized by this smallest number of reticulation vertices.

[1] B.L. Allen and M. Steel, “Subtree Transfer Operations and Their Induced Metrics on Evolutionary Trees,” Annals of Combinatorics, vol. 5, pp. 1-13, 2001.
[2] M. Baroni, S. Grünewald, V. Moulton, and C. Semple, “Bounding the Number of Hybridization Events for a Consistent Evolutionary History,” Math. Biology, vol. 51, pp. 171-182, 2005.
[3] M. Baroni, C. Semple, and M. Steel, “Hybrids in Real Time,” Systematic Biology, vol. 55, pp. 46-56, 2006.
[4] M.K. Bonet, K. St. John, R. Mahindru, and N. Amenta, “Approximating Subtree Distances between Phylogenies,” J. Computational Biology, vol. 13, pp. 1419-1434, 2006.
[5] M. Bordewich and C. Semple, “On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance,” Annals of Combinatorics, vol. 8, pp. 409-423, 2004.
[6] M. Bordewich and C. Semple, “Computing the Minimum Number of Hybridisation Events for a Consistent Evolutionary History,” Discrete Applied Math., vol. 155, pp. 914-928, 2007.
[7] R. Downey and M. Fellows, Parameterized Complexity. Springer, 1998.
[8] D. Gusfield and V. Bansal, “A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters,” Proc. Ninth Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '05), S. Miyano et al., eds. pp. 217-232, 2005.
[9] D. Gusfield, S. Eddhu, and C. Langley, “Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination,” J. Bioinformatics and Computational Biology, vol. 2, pp. 173-213, 2004.
[10] M. Hallett and J. Lagergren, “Efficient Algorithms for Lateral Gene Transfer Problems,” Proc. Fifth Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '01), pp. 149-156, 2001.
[11] J. Hein, “Reconstructing Evolution of Sequences Subject to Recombination Using Parsimony,” Math. Biosciences, vol. 98, pp.185-200, 1990.
[12] J. Hein, “A Heuristic Method to Reconstruct the History of Sequences Subject to Recombination,” J. Molecular Evolution, vol. 36, pp. 396-405, 1993.
[13] J. Hein, T. Jing, L. Wang, and K. Zhang, “On the Complexity of Comparing Evolutionary Trees,” Discrete Applied Math., vol. 71, pp. 153-169, 1996.
[14] W. Maddison, “Gene Trees in Species Trees,” Systematic Biology, vol. 46, pp. 523-536, 1997.
[15] L. Nakhleh, T. Warnow, C.R. Linder, and K. St. John, “Reconstructing Reticulate Evolution in Species—Theory and Practice,” J. Computational Biology, vol. 12, pp. 796-811, 2005.
[16] E.M. Rodrigues, M.-F. Sagot, and Y. Wakabayashi, “Some Approximation Results for the Maximum Agreement Forest Problem,” Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, M. Goemans et al., eds., pp. 159-169, Springer, 2001.
[17] C. Semple and M. Steel, Phylogenetics. Oxford Univ. Press, 2003.
[18] Y.S. Song and J. Hein, “Parsimonious Reconstruction of Sequence Evolution and Haplotyde Blocks: Finding the Minimum Number of Recombination Events,” Algorithms in Bioinformatics, Proc. WABI '03, G. Benson and R. Page, eds., pp. 287-302, 2003.
[19] L. Wang, K. Zhang, and L. Zhang, “Perfect Phylogenetic Networks with Recombination,” J. Computational Biology, vol. 8, pp. 69-78, 2001.

Index Terms:
Rooted phylogenetic tree, reticulate evolution, hybridization network, agreement forest, subtree prune and regraft
Citation:
Magnus Bordewich, Charles Semple, "Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 4, no. 3, pp. 458-466, July-Sept. 2007, doi:10.1109/tcbb.2007.1019
Usage of this product signifies your acceptance of the Terms of Use.