Skip to main content

Constructing Large Conservative Supertrees

  • Conference paper
Algorithms in Bioinformatics (WABI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 6833))

Included in the following conference series:

Abstract

Generalizations of the strict and loose consensus methods to the supertree setting, recently introduced by McMorris and Wilkinson, are studied. The supertrees these methods produce are conservative in the sense that they only preserve information (in the form of splits) that is supported by at least one the input trees and that is not contradicted by any of the input trees. Alternative, equivalent, formulations of these supertrees are developed. These are used to prove the NP-completeness of the underlying optimization problems and to give exact integer linear programming solutions. For larger data sets, a divide and conquer approach is adopted, based on the structural properties of these supertrees. Experiments show that it is feasible to solve problems with several hundred taxa and several hundred trees in a reasonable amount of time.

This work was supported in part by the National Science Foundation under grants DEB-0829674 and CCF-1017189.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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.

References

  1. Bansal, M., Burleigh, J.G., Eulenstein, O., Fernández-Baca, D.: Robinson-Foulds supertrees. Algorithms for Molecular Biology 5(1), 18 (2010)

    Article  Google Scholar 

  2. Baum, B., Ragan, M.: The MRP method. In: Bininda-Emonds, O. (ed.) Phylogenetic supertrees: Combining Information to Reveal the Tree of Life, pp. 17–34. Kluwer Academic, Dordrecht (2004)

    Chapter  Google Scholar 

  3. Beck, R.M.D., Bininda-Emonds, O.R.P., Cardillo, M., Liu, F.G.R., Purvis, A.: A higher-level MRP supertree of placental mammals. BMC Evol. Biol. 6, 93 (2006)

    Article  Google Scholar 

  4. Bininda-Emonds, O.R.P. (ed.): Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Series on Computational Biology, vol. 4. Springer, Berlin (2004)

    MATH  Google Scholar 

  5. Bininda-Emonds, O.R.P., Sanderson, M.J.: Assessment of the accuracy of matrix representation with parsimony analysis supertree construction. Syst. Biol. 50, 565–579 (2001)

    Article  Google Scholar 

  6. Cardillo, M., Bininda-Emonds, O.R.P., Boakes, E., Purvis, A.: A species-level phylogenetic supertree of marsupials. J. Zool. 264, 11–31 (2004)

    Article  Google Scholar 

  7. Chaudhary, R., Burleigh, J.G., Fernández-Baca, D.: Fast local search for unrooted Robinson-Foulds supertrees. In: Chen, J., Wang, J., Zelikovsky, A. (eds.) ISBRA 2011. LNCS, vol. 6674, pp. 184–196. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  8. Cotton, J.A., Wilkinson, M.: Majority-rule supertrees. Syst. Biol. 56, 445–452 (2007)

    Article  Google Scholar 

  9. Dong, J., Fernández-Baca, D.: Properties of majority-rule supertrees. Systematic Biology 58(3), 360–367 (2009)

    Article  Google Scholar 

  10. Dong, J., Fernández-Baca, D., McMorris, F.R.: Constructing majority-rule supertrees. Algorithms in Molecular Biology 5(2) (2010)

    Google Scholar 

  11. Dong, J., Fernández-Baca, D., McMorris, F.R., Powers, R.C.: Majority-rule (+) consensus trees. Math. Biosci. 228(1), 10–15 (2010)

    Article  MATH  Google Scholar 

  12. Goloboff, P.: Minority rule supertrees? MRP, compatibility, and minimum flip display the least frequent groups. Cladistics 21, 282–294 (2005)

    Article  Google Scholar 

  13. Gordon, A.D.: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labelled leaves. J. Classification 9, 335–348 (1986)

    Article  MATH  Google Scholar 

  14. Kennedy, M., Page, R.D.M.: Seabird supertrees: combining partial estimates of procellariiform phylogeny. The Auk 119(1), 88–108 (2002)

    Article  Google Scholar 

  15. McMorris, F.R., Wilkinson, M.: Conservative supertrees. Syst. Biol. 60(2), 232–238 (2011)

    Article  Google Scholar 

  16. Ranwez, V., Berry, V., Criscuolo, A., Fabre, P.-H., Guillemot, S., Scornavacca, C., Douzery, E.J.P.: PhySIC: A veto supertree method with desirable properties. Systematic Biology 56(5), 798–817 (2007)

    Article  Google Scholar 

  17. Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Mathematical Biosciences 53, 131–147 (1981)

    Article  MATH  Google Scholar 

  18. Scornavacca, C.: Supertree methods for phylogenomics. PhD thesis, University of Montpellier II, Montpellier, France (December 2009)

    Google Scholar 

  19. Semple, C., Steel, M.: Phylogenetics. Oxford Lecture Series in Mathematics. Oxford University Press, Oxford (2003)

    MATH  Google Scholar 

  20. Steel, M.A.: The complexity of reconstructing trees from qualitative characters and subtrees. Journal of Classification 9, 91–116 (1992)

    Article  MATH  Google Scholar 

  21. Swenson, M.S., Suri, R., Linder, C.R., Warnow, T.: An experimental study of quartets maxcut and other supertree methods. Algorithms for Molecular Biology 6, 7 (2011)

    Article  Google Scholar 

  22. Wilkinson, M., Thorley, J.L., Pisani, D.E., Lapointe, F.-J., McInerney, J.O.: Some desiderata for liberal supertrees. In: Bininda-Emonds, O.R.P. (ed.) Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Series on Computational Biology, vol. 4, pp. 65–85. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  23. Wilson, D., Reeder, D. (eds.): Mammal Species of the World: A Taxonomic and Geographic Reference, 2nd edn. Smithsonian Institution Press, Washington (1993)

    Google Scholar 

  24. Wojciechowski, M., Sanderson, M., Steele, K., Liston, A.: Molecular phylogeny of the Temperate Herbaceous Tribes of Papilionoid legumes: a supertree approach. In: Herendeen, P., Bruneau, A. (eds.) Advances in Legume Systematics, vol. 9, pp. 277–298. Royal Botanic Gardens, Kew (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dong, J., Fernández-Baca, D. (2011). Constructing Large Conservative Supertrees. In: Przytycka, T.M., Sagot, MF. (eds) Algorithms in Bioinformatics. WABI 2011. Lecture Notes in Computer Science(), vol 6833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23038-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23038-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23037-0

  • Online ISBN: 978-3-642-23038-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics