This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems
July-September 2006 (vol. 3 no. 3)
pp. 289-302
Given a set of evolutionary trees on a same set of taxa, the maximum agreement subtree problem (MAST), respectively, maximum compatible tree problem (MCT), consists of finding a largest subset of taxa such that all input trees restricted to these taxa are isomorphic, respectively compatible. These problems have several applications in phylogenetics such as the computation of a consensus of phylogenies obtained from different data sets, the identification of species subjected to horizontal gene transfers and, more recently, the inference of supertrees, e.g., Trees Of Life. We provide two linear time algorithms to check the isomorphism, respectively, compatibility, of a set of trees or otherwise identify a conflict between the trees with respect to the relative location of a small subset of taxa. Then, we use these algorithms as subroutines to solve MAST and MCT on rooted or unrooted trees of unbounded degree. More precisely, we give exact fixed-parameter tractable algorithms, whose running time is uniformly polynomial when the number of taxa on which the trees disagree is bounded. The improves on a known result for MAST and proves fixed-parameter tractability for MCT.

[1] M.A. Steel and T.J. Warnow, “Kaikoura Tree Theorems: Computing the Maximum Agreement Subtree,” Information Processing Letters, vol. 48, no. 2, pp. 77-82, 1993.
[2] M. Farach, T.M. Przytycka, and M. Thorup, “On the Agreement of Many Trees,” Information Processing Letters, vol. 55, no. 6, pp. 297-301, 1995.
[3] A. Amir and D. Keselman, “Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithm,” SIAM J. Computing, vol. 26, no. 6, pp. 1656-1669, 1997.
[4] A. Gupta and N. Nishimura, “Finding Largest Subtrees and Smallest Supertrees,” Algorithmica, vol. 21, no. 2, pp. 183-210, 1998.
[5] M.-Y. Kao, T.W. Lam, W.-K. Sung, and H.-F. Ting, “An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartte Matchings,” J. Algorithms, vol. 40, no. 2, pp. 212-233, 2001.
[6] R. Cole, M. Farach-Colton, R. Hariharan, T.M. Przytycka, and M. Thorup, “An ${\rm O}(n\log n)$ Algorithm for the Maximum Agreement Sub-Tree Problem for Binary Trees,” SIAM J. Computing, vol. 30, no. 5, pp. 1385-1404, 2001.
[7] D. Swofford, G. Olsen, P. Wadell, and D. Hillis, “Phylogenetic Inference,” Molecular Systematics, second ed., pp. 407-514, 1996.
[8] G. Ganapathy and T.J. Warnow, “Approximating the Complement of the Maximum Compatible Subset of Leaves of $k$ Trees,” Proc. Fifth Int'l Workshop Approximation Algorithms for Combinatorial Optimization (APPROX '02), pp. 122-134, 2002.
[9] V. Berry and F. Nicolas, “Maximum Agreement and Compatible Supertrees,” Proc. Ann. Symp. Combinatorial Pattern Matching, 2004.
[10] J. Jansson, J.H.-K. Ng, K. Sadakane, and W.-K. Sung, “Rooted Maximum Agreement Supertrees,” Proc. Sixth Latin Am. Symp. Theoretical Informatics (LATIN), 2004.
[11] A.M. Hamel and M.A. Steel, “Finding a Maximum Compatible Tree is NP-Hard for Sequences and Trees,” Applied Math. Letters, vol. 9, no. 2, pp. 55-59, 1996.
[12] G. Ganapathysaravanabavan and T.J. Warnow, “Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time,” Proc. First Int'l Workshop Algorithms in Bioinformatics (WABI '01), pp. 156-163, 2001.
[13] J. Hein, T. Jiang, L. Wang, and K. Zhang, “On the Complexity of Comparing Evolutionary Trees,” Discrete Applied Math., vol. 71, nos. 1-3, pp. 153-169, 1996.
[14] M.-Y. Kao, T.W. Lam, W.-K. Sung, and H.-F. Ting, “A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees,” Proc. Seventh Ann. European Symp. Algorithms (ESA'99), pp. 438-449, 1999.
[15] D. Bryant, “Building Trees, Hunting for Trees and Comparing Trees: Theory and Method in Phylogenetic Analysis,” PhD dissertation, Univ. of Canterbury, 1997.
[16] R.G. Downey, M.R. Fellows, and U. Stege, “Computational Tractability: The View from Mars,” Bull. European Assoc. for Theoretical Computer Science, vol. 69, pp. 73-97, 1999.
[17] J. Alber, J. Gramm, and R. Niedermeier, “Faster Exact Algorithms for Hard Problems: A Parameterized Point of View,” Discrete Math., vol. 229, nos. 1-3, pp. 3-27, 2001.
[18] V. Berry, S. Guillemot, F. Nicolas, and C. Paul, “On the Approximation of Computing Evolutionary Trees,” Proc. 11th Int'l Computing and Combinatorics Conf. (COCOON '05), Lecture Notes in Computer Science, no. 3595, pp. 115-125, 2005.
[19] D. Gusfield, “Efficient Algorithms for Inferring Evolutionary Trees,” Networks, vol. 21, pp. 19-28, 1991.
[20] T.J. Warnow, “Tree Compatibility and Inferring Evolutionary History,” J. Algorithms, vol. 16, no. 3, pp. 388-407, 1994.
[21] D. Bryant and M.A. Steel, “Extension Operations on Sets of Leaf-Labelled Trees,” Advances in Applied Math., vol. 16, no. 4, pp. 425-453, 1995.
[22] G.F. Eastabrook, C.S. Johnson, and F.R. McMorris, “An Algebraic Analysis of Cladistic Characters,” Discrete Math., vol. 16, pp. 141-147, 1976.
[23] C. Semple and M. Steel, “Phylogenetics,” Oxford Lecture Series in Math. and Its Applications, Oxford Univ. Press, vol. 24, 2003.
[24] D. Bryant and V. Berry, “A Structured Family of Clustering and Tree Construction Methods,” Advances in Applied Math., vol. 27, no. 4, pp. 705-732, 2001.
[25] G.F. Eastabrook and F.R. McMorris, “When Is One Estimate of Evolutionary Relationships a Refinement of Another?” J. Math. Biology, vol. 10, pp. 367-373, 1980.
[26] R. Cole and R. Hariharan, “Dynamic LCA Queries on Trees,” Proc. 10th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '99), pp. 235-244, 1999.
[27] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press, 2001.
[28] U. Feige, M.M. Halldórsson, and G. Kortsarz, “Approximating the Domatic Number,” Proc. 32nd Ann. ACM Symp. Theory of Computing (STOC '00), pp. 134-143, 2000.
[29] R. Niedermeier and P. Rossmanith, “An Efficient Fixed Parameter Algorithm for $3{\hbox{-}} \rm Hitting$ Set,” J. Discrete Algorithms, vol. 1, no. 1, pp. 89-102, 2003.
[30] R.G. Downey, “Parameterized Complexity for the Skeptic,” Proc. 18th IEEE Conf. Computational Complexity (CCC '03), pp. 147-168, 2003.

Index Terms:
Phylogenetics, algorithms, consensus, pattern matching, trees, compatibility, fixed-parameter tractability.
Citation:
Vincent Berry, Fran?ois Nicolas, "Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 3, pp. 289-302, July-Sept. 2006, doi:10.1109/TCBB.2006.39
Usage of this product signifies your acceptance of the Terms of Use.