Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees

  • Feng Shi
  • Jianer Chen
  • Qilong Feng
  • Jianxin Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7936)


The Maximun Agreement Forest problem (maf) asks for a largest common subforest of a collection of phylogenetic trees. The maf problem on two binary phylogenetic trees has been studied extensively in the literature. In this paper, we present the first group of fixed-parameter tractable algorithms for the maf problem on multiple (i.e., two or more) binary phylogenetic trees. Our techniques work fine for the problem for both rooted trees and unrooted trees. The computational complexity of our algorithms is comparable with that of the known algorithms for two trees, and is independent of the number of phylogenetic trees for which a maximum agreement forest is constructed.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Allen, B., Steel, M.: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics 5(1), 1–15 (2001)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bordewich, M., McCartin, C., Semple, C.: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3), 458–471 (2008)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Bordewich, M., Semple, C.: On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics 8(4), 409–423 (2005)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chataigner, F.: Approximating the maximum agreement forest on k trees. Information Processing Letters 93, 239–244 (2005)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Chen, J., Fan, J.-H., Sze, S.-H.: Improved algoithms for the maximum agreement forest problem on general trees. In: WG 2013 (submitted, 2013)Google Scholar
  6. 6.
    Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)CrossRefGoogle Scholar
  7. 7.
    Hallett, M., McCartin, C.: A faster FPT algorithm for the maximum agreement forest problem. Theory of Computing Systems 41(3), 539–550 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Applied Mathematics 71, 153–169 (1996)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Hodson, F., Kendall, D., Tauta, P. (eds.): The recovery of trees from measures of dissimilarity. Mathematics in the Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, Edinburgh (1971)Google Scholar
  10. 10.
    Li, M., Tromp, J., Zhang, L.: On the nearest neighbour interchange distance between evolutionary trees. Journal on Theoretical Biology 182(4), 463–467 (1996)CrossRefGoogle Scholar
  11. 11.
    Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Mathematical Biosciences 53(1-2), 131–147 (1981)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Rodrigues, E., Sagot, M., Wakabayashi, Y.: The maximum agreement forest problem: approximation algorithms and computational experiments. Theoretical Computer Science 374(1-3), 91–110 (2007)MathSciNetzbMATHCrossRefGoogle Scholar
  13. 13.
    Swofford, D., Olsen, G., Waddell, P., Hillis, D.: Phylogenetic inference. In: Molecular Systematics, 2nd edn., pp. 407–513. Sinauer Associates (1996)Google Scholar
  14. 14.
    Whidden, C., Beiko, R., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests. CoRR. abs/1108.2664 (2011)Google Scholar
  15. 15.
    Whidden, C., Zeh, N.: A unifying view on approximation and FPT of agreement forests. In: Salzberg, S.L., Warnow, T. (eds.) WABI 2009. LNCS, vol. 5724, pp. 390–402. Springer, Heidelberg (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Feng Shi
    • 1
  • Jianer Chen
    • 1
    • 2
  • Qilong Feng
    • 1
  • Jianxin Wang
    • 1
  1. 1.School of Information Science and EngineeringCentral South UniversityChina
  2. 2.Department of Computer Science and EngineeringTexas A&M UniversityUSA

Personalised recommendations