Table of Contents Author Guidelines Submit a Manuscript
Advances in Bioinformatics
Volume 2011, Article ID 524182, 21 pages
http://dx.doi.org/10.1155/2011/524182
Research Article

Polynomial Supertree Methods Revisited

Department of Computer Science, Friedrich Schiller University, 07743 Jena, Germany

Received 7 April 2011; Revised 1 August 2011; Accepted 15 September 2011

Academic Editor: David Posada

Copyright © 2011 Malte Brinkmeyer et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. O. R. P. Bininda-Emonds, “The evolution of supertrees,” Trends in Ecology and Evolution, vol. 19, no. 6, pp. 315–322, 2004. View at Publisher · View at Google Scholar · View at PubMed
  2. A. D. Gordon, “Consensus supertrees: the synthesis of rooted trees containing overlapping sets of labeled leaves,” Journal of Classification, vol. 3, no. 2, pp. 335–348, 1986. View at Publisher · View at Google Scholar · View at MathSciNet
  3. O. R. P. Bininda-Emonds, Ed., Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, vol. 4 of Computational Biology Book Series, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004.
  4. A. de Queiroz and J. Gatesy, “The supermatrix approach to systematics,” Trends in Ecology and Evolution, vol. 22, no. 1, pp. 34–41, 2007. View at Publisher · View at Google Scholar · View at PubMed
  5. O. R. P. Bininda-Emonds, M. Cardillo, K. E. Jones et al., “The delayed rise of present-day mammals,” Nature, vol. 446, no. 7135, pp. 507–512, 2007. View at Publisher · View at Google Scholar · View at PubMed
  6. S. Roch, “A short proof that phylogenetic tree reconstruction by maximum likelihood is hard,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 1, pp. 92–94, 2006. View at Publisher · View at Google Scholar · View at PubMed
  7. L. R. Foulds and R. L. Graham, “The steiner problem in phylogeny is NP-complete,” Advances in Applied Mathematics, vol. 3, no. 1, pp. 43–49, 1982. View at Google Scholar
  8. A. Stamatakis, T. Ludwig, and H. Meier, “Parallel inference of a 10.000-taxon phylogeny with maximum likelihood,” in Proceedings of International Euro-Par Conference (Euro-Par '04), vol. 3149 of Lecture Notes in Computer Science, pp. 997–1004, Springer, 2004.
  9. O. R. P. Bininda-Emonds, “Supertree construction in the genomic age,” Methods in Enzymology, vol. 395, pp. 745–757, 2005. View at Publisher · View at Google Scholar · View at PubMed
  10. B. R. Baum, “Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees,” Taxon, vol. 41, no. 1, pp. 3–10, 1992. View at Google Scholar
  11. M. A. Ragan, “Matrix representation in reconstructing phylogenetic relationships among the eukaryotes,” BioSystems, vol. 28, no. 1–3, pp. 47–55, 1992. View at Publisher · View at Google Scholar
  12. D. Chen, O. Eulenstein, D. Fernández-Baca, and M. Sanderson, “Minimum-flip supertrees: complexity and algorithms,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 2, pp. 165–173, 2006. View at Publisher · View at Google Scholar · View at PubMed · View at Scopus
  13. A. Rodrigo, “A comment on baum method for combining phylogenetic trees,” Taxon, vol. 42, pp. 631–636, 1993. View at Google Scholar
  14. H. Ross and A. Rodrigo, “An assessment of matrix representation with compatibility in supertree construction,” in Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, O. R. Bininda-Emonds, Ed., vol. 4 of Computational Biology Book Series, pp. 35–63, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004. View at Google Scholar
  15. R. D. M. Page, “Modified mincut supertrees,” in Proceedings of Workshop on Algorithms in Bioinformatics (WABI '02), vol. 2452 of Lecture Notes in Computer Science, pp. 537–552, Springer, 2002.
  16. A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman, “Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions,” SIAM Journal on Computing, vol. 10, no. 3, pp. 405–421, 1981. View at Google Scholar
  17. C. Semple and M. Steel, “A supertree method for rooted trees,” Discrete Applied Mathematics, vol. 105, no. 1–3, pp. 147–158, 2000. View at Google Scholar
  18. S. J. Willson, “Constructing rooted supertrees using distances,” Bulletin of Mathematical Biology, vol. 66, no. 6, pp. 1755–1783, 2004. View at Publisher · View at Google Scholar · View at PubMed · View at MathSciNet
  19. J. A. Cotton, C. S. Slater, and M. Wilkinson, “Discriminating supported and unsupported relationships in supertrees using triplets,” Systematic Biology, vol. 55, no. 2, pp. 345–350, 2006. View at Publisher · View at Google Scholar · View at PubMed
  20. P. A. Goloboff, “Minority rule supertrees? MRP, compatibility, and minimum flip may display the least frequent groups,” Cladistics, vol. 21, no. 3, pp. 282–294, 2005. View at Publisher · View at Google Scholar
  21. P. A. Goloboff and D. Pol, “Semi-strict supertrees,” Cladistics, vol. 18, no. 5, pp. 514–525, 2002. View at Publisher · View at Google Scholar
  22. O. R. P. Bininda-Emonds, “Novel versus unsupported clades: assessing the qualitative support for clades in MRP supertrees,” Systematic Biology, vol. 52, no. 6, pp. 839–848, 2003. View at Publisher · View at Google Scholar
  23. V. Ranwez, V. Berry, A. Criscuolo et al., “PhySIC: a veto supertree method with desirable properties,” Systematic Biology, vol. 56, no. 5, pp. 798–817, 2007. View at Publisher · View at Google Scholar · View at PubMed
  24. C. Scornavacca, V. Berry, V. Lefort, E. J. P. Douzery, and V. Ranwez, “PhySIC_IST: cleaning source trees to infer more informative supertrees,” BMC Bioinformatics, vol. 9, article 413, 2008. View at Publisher · View at Google Scholar · View at PubMed
  25. A. Criscuolo, V. Berry, E. J. Douzery, and O. Gascuel, “SDM: a fast distance-based approach for (super) tree building in phylogenomics,” Systematic Biology, vol. 55, no. 5, pp. 740–755, 2006. View at Publisher · View at Google Scholar · View at PubMed
  26. D. H. Huson, S. M. Nettles, and T. J. Warnow, “Disk-covering, a fast-converging method for phylogenetic tree reconstruction,” Journal of Computational Biology, vol. 6, no. 3-4, pp. 369–386, 1999. View at Publisher · View at Google Scholar · View at PubMed
  27. D. H. Huson, L. Vawter, and T. J. Warnow, “Solving large scale phylogenetic problems using DCM2,” in Proceedings of International Conference on Intelligent Systems for Molecular Biology (ISMB '99), pp. 118–129, 1999.
  28. U. W. Roshan, T. Warnow, B. M. E. Moret, and T. L. Williams, “Rec-I-DCM3: a fast algorithmic technique for reconstructing large phylogenetic trees,” in Proceedings of IEEE Computational Systems Bioinformatics Conference (CSB '04), pp. 98–109, August 2004.
  29. O. R. P. Bininda-Emonds and M. J. Sanderson, “Assessment of the accuracy of matrix representation with parsimony analysis supertree construction,” Systematic Biology, vol. 50, no. 4, pp. 565–579, 2001. View at Google Scholar
  30. S. Buerki, F. Forest, N. Salamin, and N. Alvarez, “Comparative performance of supertree algorithms in large data sets using the soapberry family (sapindaceae) as a case study,” Systematic Biology, vol. 60, no. 1, pp. 32–44, 2011. View at Google Scholar
  31. O. Eulenstein, D. Chen, J. G. Burleih, D. Fernández-Baca, and M. J. Sanderson, “Performance of flip supertree construction with a heuristic algorithm,” Systematic Biology, vol. 53, no. 2, pp. 299–308, 2004. View at Publisher · View at Google Scholar · View at PubMed
  32. C. Levasseur and F.-J. Lapointe, “Total evidence, average consensus and matrix representation with parsimony: what a difference distances make,” Evolutionary Bioinformatics, vol. 2, pp. 249–253, 2006. View at Google Scholar
  33. M. S. Swenson, F. Barbançon, T. Warnow, and C. R. Linder, “A simulation study comparing supertree and combined analysis methods using SMIDGen,” Algorithms for Molecular Biology, vol. 5, no. 1, article 8, 2010. View at Publisher · View at Google Scholar · View at PubMed
  34. C. Semple and M. A. Steel, Phylogenetics, Oxford Lecture Series in Mathematics and Its Applications, Oxford University Press, 2003.
  35. J. L. Thorley and M. Wilkinson, “A view of supertree methods,” in Bioconsensus, M. Jannowitz, F. Lapointe, F. McMorris, and F. Roberts, Eds., vol. 61, The American Mathematical Society, 2003. View at Google Scholar
  36. F. J. Lapointe and G. Cucumel, “The average consensus procedure: combination of weighted trees containing identical or overlapping sets of taxa,” Systematic Biology, vol. 46, no. 2, pp. 306–311, 1997. View at Google Scholar
  37. L. C. Lapointe, “Phylogenetic supertrees: combining information to reveal the tree of life,” in Everything You always Wanted to Know about the Average Consensus and More, pp. 87–106, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004. View at Google Scholar
  38. A. Criscuolo and O. Gascuel, “Fast NJ-like algorithms to deal with incomplete distance matrices,” BMC Bioinformatics, vol. 9, article 166, 2008. View at Publisher · View at Google Scholar · View at PubMed
  39. B. R. Baum and M. A. Ragan, “The MRP method,” in Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, O. R. Bininda-Emonds, Ed., vol. 4 of Computational Biology Book Series, chapter 1, pp. 17–34, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2004. View at Google Scholar
  40. W. M. Fitch, “Toward defining the course of evolution: minimum change for a specific tree topology,” Systematic Zoology, vol. 20, no. 4, pp. 406–416, 1971. View at Google Scholar
  41. M. J. Sanderson, “r8s: inferring absolute rates of molecular evolution and divergence times in the absence of a molecular clock,” Bioinformatics, vol. 19, no. 2, pp. 301–302, 2003. View at Publisher · View at Google Scholar
  42. A. Rambaut and N. C. Grassly, “Seq-gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees,” Computer Applications in the Biosciences, vol. 13, no. 3, pp. 235–238, 1997. View at Google Scholar
  43. Z. Yang, “Maximum likelihood phylogenetic estimation from DNA sequences with variable rates over sites: approximate methods,” Journal of Molecular Evolution, vol. 39, no. 3, pp. 306–314, 1994. View at Google Scholar
  44. J. W. Higdon, O. R. P. Bininda-Emonds, R. M. D. Beck, and S. H. Ferguson, “Phylogeny and divergence of the pinnipeds (Carnivora: Mammalia) assessed using a multigene dataset,” BMC Evolutionary Biology, vol. 7, no. 1, article 216, 2007. View at Publisher · View at Google Scholar · View at PubMed
  45. A. Stamatakis, “RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models,” Bioinformatics, vol. 22, no. 21, pp. 2688–2690, 2006. View at Publisher · View at Google Scholar · View at PubMed
  46. D. Swafford, “Paup*: phylogenetic analysis using parsimony (*and other methods),” 2002, Version 4. View at Google Scholar
  47. T. Griebel, M. Brinkmeyer, and S. Böcker, “EPoS: a modular software framework for phylogenetic analysis,” Bioinformatics, vol. 24, no. 20, pp. 2399–2400, 2008. View at Publisher · View at Google Scholar · View at PubMed
  48. D. F. Robinson and L. R. Foulds, “Comparison of phylogenetic trees,” Mathematical Biosciences, vol. 53, no. 1-2, pp. 131–147, 1981. View at Publisher · View at Google Scholar
  49. W. Day, “Analysis of quartet dissimilarity measures between undirected phylogenetic trees,” Systematic Biology, vol. 35, pp. 325–333, 1986. View at Google Scholar
  50. A. D. Gordon, “On the assessment and comparison of classifications,” in Analyse de Donnees et Informatique, R. Tomassine, Ed., pp. 149–160, INRIA, Le Chesnay, France, 1980. View at Google Scholar
  51. D. H. Colless, “Congruence between morphometric and allozyme data for menidia species: a reappraisal,” Systematic Zoology, vol. 29, no. 3, pp. 288–299, 1980. View at Google Scholar
  52. D. H. Colless, “Predictivity and stability in classifications: some comments on recent studies,” Systematic Zoology, vol. 30, no. 3, pp. 325–331, 1981. View at Google Scholar
  53. O. R. P. Bininda-Emonds, “The future of supertrees: bridging the gap with supermatrices,” in Proceedings of Willi-Hennig-Symposium 2009, vol. 3 of Supplement of Palaeodiversity, pp. 99–106, 2010.
  54. A. Kupczok, H. A. Schmidt, and A. von Haeseler, “Accuracy of phylogeny reconstruction methods combining overlapping gene data sets,” Algorithms for Molecular Biology, vol. 5, p. 37, 2010. View at Publisher · View at Google Scholar · View at PubMed
  55. M. S. Swenson, R. Suri, C. R. Linder, and T. Warnow, “An experimental study of Quartets MaxCut and other supertree methods,” Algorithms for Molecular Biology, vol. 6, no. 1, article 7, 2011. View at Publisher · View at Google Scholar · View at PubMed