Skip to main content
SpringerLink
Log in

On the Maximum Parsimony Distance Between Phylogenetic Trees

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

Within the field of phylogenetics there is great interest in distance measures to quantify the dissimilarity of two trees. Here, based on an idea of Bruen and Bryant, we propose and analyze a new distance measure: theMaximum Parsimony (MP) distance. This is based on the difference of the parsimony scores of a single character on both trees under consideration, and the goal is to find the character which maximizes this difference. In this article we show that this new distance is a metric and provides a lower bound to the well-known Subtree Prune and Regraft (SPR) distance. We also show that to compute the MP distance it is sufficient to consider only characters that are convex on one of the trees, and prove several additional structural properties of the distance. On the complexity side, we prove that calculating the MP distance is in general NP-hard, and identify an interesting island of tractability in which the distance can be calculated in polynomial time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alimonti P., Kann V.: Some APX-completeness results for cubic graphs. Theoret. Comput. Sci. 237(1-2), 123–134 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Allen B.L., Steel M.: Subtree transfer operations and their induced metrics on evolutionary trees. Ann. Combin. 5(1), 1–15 (2001)

    Article  MathSciNet  Google Scholar 

  3. Archie, J., Day, W., Felsenstein, J., Maddison, W., Meacham, C., Rohlf, F., Swofford, D.: The newick tree format. Avaiable online at: http://evolution.genetics.washington.edu/phylip/newicktree.html (2000)

  4. Beiko, R.G., Hamilton, N.: Phylogenetic identification of lateral genetic transfer events. BMC Evol. Biol. 6, #P15 (2006)

  5. Bonet M.L., St. John K.: On the complexity of uSPR distance. IEEE/ACM Trans. Comput. Biol. Bioinform. 7(3), 572–576 (2010)

    Article  Google Scholar 

  6. Bordewich M., Semple C.: On the computational complexity of the rooted subtree prune and regraft distance. Ann. Combin. 8(4), 409–423 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Brooks R.L.: On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37(2), 194–197 (1941)

    Article  MathSciNet  Google Scholar 

  8. Bruen T.C., Bryant D.: Parsimony via consensus. Syst. Biol. 57(2), 251–256 (2008)

    Article  Google Scholar 

  9. Bryant D.: The splits in the neighborhood of a tree. Ann. Combin. 8(1), 1–11 (2004)

    Article  MATH  Google Scholar 

  10. Buneman P.: The recovery of trees from measures of dissimilarity. In: Hodson F.R., Kendall D.G., Tautu P.T. (eds.) Mathematics in the Archaeological and Historical Sciences, pp. 387-395. Edinburgh University Press, Edinburgh (1971)

    Google Scholar 

  11. Catlin P.A.: Brooks’ graph-coloring theorem and the independence number. J. Combin. Theory Ser. B 27(1), 42–48 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  12. Chor B., Tuller T.: Finding a maximum likelihood tree is hard. J. ACM 53(5), 722–744 (2006)

    Article  MathSciNet  Google Scholar 

  13. Collins, J.S.: Rekernelisation algorithms in hybrid phylogenies. Master Thesis. University of Canterbury, New Zealand (2009)

  14. Dailey D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Math. 30(3), 289–293 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ding Y., Grünewald S., Humphries P.J.: On agreement forests. J. Combin. Theory Ser. A 118(7), 2059–2065 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Fitch W.: Toward defining the course of evolution: minimum change for a specific tree topology. Syst. Zool. 20(4), 406–416 (1971)

    Article  Google Scholar 

  17. Foulds L.R., Graham R.L.: The Steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3(1), 43–49 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  18. Hartigan J.A.: Minimum mutation fits to a given tree. Biometrics 29(1), 53–65 (1973)

    Article  Google Scholar 

  19. Kundu S., Misra J.: A linear tree partitioning algorithm. SIAM J. Comput. 6(1), 151–154 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  20. Lin Y., Rajan V., Moret B.M.: A metric for phylogenetic trees based on matching. IEEE/ACM Trans. Comput. Biol. Bioinform. 9(4), 1014–1022 (2012)

    Article  Google Scholar 

  21. Linz S., Semple C.: A cluster reduction for computing the subtree distance between phylogenies. Ann. Combin. 15(3), 465–484 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  22. Robinson D.F., Foulds L.R.: Comparison of phylogenetic trees. Math. Biosci. 53(1-2), 131–147 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  23. Roch S.: A short proof that phylogenetic tree reconstruction by maximum likelihood is hard. IEEE/ACM Trans. Comput. Biol. Bioinform. 3(1), 92–94 (2006)

    Article  MathSciNet  Google Scholar 

  24. Rodrigues E.M., Sagot M.-F., Wakabayashi Y.: The maximum agreement forest problem: approximation algorithms and computational experiments. Theoret. Comput. Sci. 374(1-3), 91–110 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Semple C., Steel M.: Phylogenetics. Oxford University Press, Oxford (2003)

    MATH  Google Scholar 

  26. van Iersel L., Kelk S., Lekić N., Scornavacca C.: A practical approximation algorithm for solving massive instances of hybridization number. In: Raphael B., Tang J. (eds.) Algorithms in Bioinformatics, pp. 430-440. Springer-Verlag, Berlin (2012)

    Chapter  Google Scholar 

  27. van Iersel L., Kelk S., Lekić N., Stougie L.: Approximation algorithms for nonbinary agreement forests. SIAM J. Discrete Math. 28(1), 49–66 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  28. Whidden C., Beiko R.G., Zeh N.: Fixed-parameter algorithms for maximum agreement forests. SIAM J. Comput. 42(4), 1431–1466 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Ernst-Moritz-Arndt University of Greifswald, Walther-Rathenau-Str. 47, 17487, Greifswald, Germany

    Mareike Fischer

  2. Department of Knowledge Engineering (DKE), Maastricht University, P.O. Box 616, 6200 MD, Maastricht, The Netherlands

    Steven Kelk

Authors
  1. Mareike Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steven Kelk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mareike Fischer.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fischer, M., Kelk, S. On the Maximum Parsimony Distance Between Phylogenetic Trees. Ann. Comb. 20, 87–113 (2016). https://doi.org/10.1007/s00026-015-0298-1

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-015-0298-1

Mathematics Subject Classification

Keywords

Search

Navigation