Skip to main content
Springer Nature Link
Log in

Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees

  • Conference paper
Frontiers in Algorithmics (FAW 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8497))

Included in the following conference series:

Abstract

Given two rooted binary phylogenetic trees with identical leaf label-set, the Maximum Agreement Forest (Maf) problem asks for a largest common subforest of these two trees. This problem is known to be NP-complete and MAX SNP-hard, and the previously best approximation algorithm for this problem has a ratio 3. In this paper, we present an improved 2.5-approximation algorithm for the Maf problem on two rooted binary phylogenetic trees.

This work is supported by the National Natural Science Foundation of China under Grants (61103033, 61173051, 61232001), and Hunan Provincial Innovation Foundation For Postgraduate (CX2013B073).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Robinson, D., Foulds, L.: Comparison of phylogenetic trees. Mathematical Biosciences 53(1-2), 131–147 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  2. Li, M., Tromp, J., Zhang, L.: On the nearest neighbour interchange distance between evolutionary trees. Journal on Theoretical Biology 182(4), 463–467 (1996)

    Article  Google Scholar 

  3. 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 

  4. Swofford, D., Olsen, G., Waddell, P., Hillis, D.: Phylogenetic inference. In: Molecular Systematics, 2nd edn., pp. 407–513. Sinauer, Associates (1996)

    Google Scholar 

  5. Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Applied Mathematics 71, 153–169 (1996)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  7. Rodrigues, E.M., Sagot, M.-F., Wakabayashi, Y.: Some approximation results for the maximum agreement forest problem. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 159–169. Springer, Heidelberg (2001)

    Google Scholar 

  8. Bonet, M., John, R., Mahindru, R., Amenta, N.: Approximating subtree distances between phylogenies. J. Comput. Biol. 13(8), 1419–1434 (2006)

    Article  MathSciNet  Google Scholar 

  9. Bordewich, M., McCartin, C., Semple, C.: A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3), 458–471 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  10. 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)

    Article  MATH  MathSciNet  Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Whidden, C., Beiko, R., Zeh, N.: Fixed-parameter and approximation algorithms for maximum agreement forests. CoRR. abs/1108.2664 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, China

    Feng Shi, Jie You & Qilong Feng

Authors
  1. Feng Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie You
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qilong Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Texas A&M University, USA

    Jianer Chen

  2. Cornell University, USA

    John E. Hopcroft

  3. School of Information Science and Engineering, Central South University, 410083, Changsha, China

    Jianxin Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Shi, F., You, J., Feng, Q. (2014). Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08016-1_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08015-4

  • Online ISBN: 978-3-319-08016-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation