SuperFine: Fast and accurate supertree estimation

Systematic Biology

Volumn 61, Issue 2, 2012, Pages 214-227

  Swenson, M Shel ^a   Suri, Rahul ^a   Linder, C Randal ^b   Warnow, Tandy ^a  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Algorithms; maximum likelihood; MRP; phylogenetics; simulation; supertrees

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; CLASSIFICATION; COMPUTER SIMULATION; METHODOLOGY; PHYLOGENY; STATISTICAL MODEL;

ALGORITHMS; CLASSIFICATION; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; LIKELIHOOD FUNCTIONS; MODELS, BIOLOGICAL; PHYLOGENY;

EID: 84857250162     PISSN: 10635157     EISSN: 1076836X     Source Type: Journal    
DOI: 10.1093/sysbio/syr092     Document Type: Article

References (48)

1. Bansal M., Burleigh J.G., Eulenstein O., Fernndez-Baca D. 2009. Robinson-Foulds supertrees. Algorithms Mol. Biol. 5:18.
2. Baum B.R. 1992. Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon. 41:3-10.
3. Baum B.R., Ragan M.A. 2004. The MRP method. In: Bininda-Emonds O.R.P., editor. Phylogenetic Supertrees: combining information to reveal The Tree Of Life. Dordrecht (the Netherlands): Kluwer Academic. p. 17-34.
4. Beck R.M.D., Bininda-Emonds O.R.P., Cardillo M., Liu F.G.R., Purvis A. 2006. A higher-level MRP supertree of placental mammals. BMC Evol. Biol. 6:93.
5. Bininda-Emonds O.R.P. 2003. Novel versus unsupported clades: assessing the qualitative support for clades in MRP supertrees. Syst. Biol. 52: 839-848. (Pubitemid 38106049)
6. Bininda-Emonds O.R.P. 2004. Phylogenetic Supertrees: combining information to reveal The Tree Of Life. Dordrecht (the Netherlands): Kluwer Academic (Computational Biology).
7. Bininda-Emonds O.R.P., Bryant H.N. 1998. Properties of matrix representations with parsimony analyses. Syst. Biol. 47:497-508. (Pubitemid 128451088)
8. Burleigh J.G., Eulenstein O., Fernndez-Baca D., Sanderson M.J. 2004. MRF supertrees. In: Bininda-Emonds O. R. P., editor. Phylogenetic Supertrees: combining information to reveal The Tree Of Life. Dordrecht (the Netherlands): Kluwer Academic. p. 65-86.
9. Cardillo M., Bininda-Emonds O.R.P., Boakes E., Purvis A. 2004. A species-level phylogenetic supertree of marsupials. J. Zool. 264: 11-31. (Pubitemid 39246912)
10. Chen D., Eulenstein O., Fernndez-Baca D., Sanderson M.J. 2006. Minimum-flip supertrees: complexity and algorithms. IEEE/ACM Trans. Comp. Biol. Bioinform. 3:165-173.
11. Cotton J.A., Wilkinson M. 2007. Majority-rule supertrees. Syst. Biol. 56:445-452.
12. Creevey C., McInerney J. 2005. Clann: investigating phylogenetic information through supertree analyses. Bioinformatics. 21:390-392. (Pubitemid 40246612)
13. Day W.H.E. 1985. Optimal algorithms for comparing trees with labeled leaves. J. Classif. 2:7-28.
14. Foulds L.R. Graham R.L. 1982. The Steiner problem in phylogeny is NP-complete. Adv. in Appl. Math. 3:299.
15. Goloboff P., Farris J., Nixon K. 2008. TNT, a free program for phylogenetic analysis. Cladistics. 24:774-786.
16. Holland B., Conner G., Huber K., Moulton V. 2007. Imputing supertrees and supernetworks from quartets. Syst. Biol. 56:57-67.
17. Huson D., Nettles S.,Warnow T. 1999. Disk-covering, a fast converging method for phylogenetic tree reconstruction. J. Comput. Biol. 6:369-386.
18. Huson D., Vawter L., Warnow T. 1999. Solving large scale phylogenetic problems using DCM2. In: Lengauer T., Schneider R., Bork P., Brutlag D.L., Glasgow J.I., Mewes H.W., Zimmer R., editors. Proceedings of the 7th International Conference on Intelligent Systems for Molecular Biology (ISMB'99). Association for the Advancement of Artificial Intelligence Press.
19. Jiang T., Kearney P., Li M. 2001. A polynomial-time approximation scheme for inferring evolutionary trees from quartet topologies and its applications. SIAM J. Comput. 30:1924-1961.
20. Kennedy M., Page R. 2002. Seabird supertrees: combining partial estimates of procellariiform phylogeny. Auk. 119:88-108. (Pubitemid 34231482)
21. Liu K., Linder C.R., Suri R.,Warnow T. 2010. Multiple sequence alignment: a major challenge to large-scale phylogenetics. PLoS Curr. Accessed 18 November 2011.
22. McMahon, M., Sanderson M. 2006. Phylogenetic supermatrix analysis of GenBank sequences from 2228 papilionoid legumes. Syst. Biol. 55:818-836.
23. Moret B., Tang J., Warnow T. 2005. Reconstructing phylogenies from gene-content and gene-order data. In: Gascuel O., editor. Mathematics of evolution and phylogeny. Oxford (UK): Oxford University Press. p. 321-352.
24. Nixon K.C. 1999. The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics. 15:407-414. (Pubitemid 30203167)
25. Pisani D., Wilkinson M. 2002. Matrix representation with parsimony, taxonomic congruence, and total evidence. Syst. Biol. 51:151-155. (Pubitemid 35169412)
26. Price M.N., Dehal P.S., Arkin A.P. 2010. FastTree 2-approximately maximum-likelihood trees for large alignments. PLoS One 5:e9490. doi:10.1371/journal.pone.0009490.
27. Ragan, M. A. 1992. Phylogenetic inference based on matrix representation of trees. Mol. Phylogenet. Evol. 1:53-58.
28. Ranwez V., Berry V., Criscuolo A., Fabre P., Guillemot S., Scornavacca C., Douzery E. 2007. PhySIC: a veto supertree method with desirable properties. Syst. Biol. 56:798-817.
29. Ranwez V., Criscuolo A., Douzery E.J. 2010. SuperTriplets: a triplet-based supertree approach to phylogenomics. Bioinformatics. 26:i115-i123.
30. Roshan U., Moret B., Williams T., Warnow T. 2004a. Performance of supertree methods on various dataset decompositions. In: Bininda-Emonds O.R.P., editor. Phylogenetic Supertrees: combining information to reveal The Tree of Life. Kluwer Academics. (Computational Biology; vol. 3), (Andreas Dress, series editor).
31. Roshan U., Moret B.,Williams T.,Warnow T. 2004b. Rec-I-DCM3: a fast algorithmic technique for reconstructing large phylogenetic trees. In: Brennder S., Schwartz J., Altman R., Kohane I., Toga A., Kikinis R., editors. Proceedings of the 3rd Computational Systems Biology Conference (CSB'05) Proceedings of the IEEE. Los Alamitos (CA): IEEE Computer Society. p. 98-109. (Pubitemid 40276243)
32. Snir S., Rao S. 2010. Quartets MaxCut: a divide and conquer quartets algorithm. IEEE/ACM Trans. Comput. Biol. Bioinform. 7:704-718.
33. Stamatakis A. 2006. RAxML-NI-HPC: Maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics. 22:2688-2690. (Pubitemid 44642609)
34. Steel M., Rodrigo A. 2008. Maximum likelihood supertrees. Syst. Biol. 57:243-250. (Pubitemid 351502944)
35. Sukumaran J., Holder M.T. 2010. Dendropy: a Python library for phylogenetic computing. Bioinformatics. 26:1569-1571.
36. Swenson M. 2008. Phylogenetic supertree methods [dissertation]. Austin (TX): The University of Texas at Austin.
37. Swenson M.S., Barbancn F., Linder C.R., Warnow T. 2009. A simulation study comparing supertree and combined analysis methods using SMIDGen. In: Salzberg S., Warnow T., editors. Proceedings of the 2009 Workshop on Algorithms in Bioinformatics (WABI). Berlin-Heidelbeg (Germany): Springer. p. 333-344.
38. Swenson M.S., Barbancn F., Linder C.R., Warnow T. 2010. A simulation study comparing supertree and combined analysis methods using SMIDGen. Algorithms Mol. Biol. 5. doi:10.1186/1748-7188-5-8.
39. Swenson M.S., Suri R., Linder C.R.,Warnow T. 2010a. An experimental study of Quartets MaxCut and other supertree methods. In: Moulton V., Singh M., editors. Proceedings of the 2010 Workshop on Algorithms in Bioinformatics (WABI). Berlin-Heidelberg (Germany): Springer. p. 288-299.
40. Swenson M.S., Suri R., Linder C.R., Warnow T. 2010b. An experimental study of Quartets MaxCut and other supertree methods. Algorithms Mol. Biol. 6:1-11.
41. Swofford D. 2002. PAUP*: phylogenetic analysis using parsimony (*and other methods). Version 4. Sunderland (MA): Sinauer Associates.
42. Wang L., Jiang T. 1994. On the complexity of multiple sequence alignment. J. Comput. Biol. 1:337-348.
43. Warnow T. 2006. Large-scale phylogenetic reconstruction. In: Aluru S., editor.) Handbook of Computational Biology. Boca Raton (FL): Chapman and Hall. (CRC Computer and Information Science Series). p. 211-2123.
44. Warnow T., Moret B.M., St. John K. 2001. Absolute convergence: true trees from short sequences. In: Rao Kosaraju S., editor. Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 01). Philadelphia (PA): SIAM (Society for Industrial and Applied Mathematics). p. 186-195.
45. Wilkinson M., Pisani D., Cotton J., Corfe I. 2005. Measuring support and finding unsupported relationships in supertrees. Syst. Biol. 54:823-831. (Pubitemid 43142298)
46. Wilkinson M., Thorley J.L., Pisani D.E., Lapointe F.J., McInerney J.O. 2004. Some desiderata for liberal supertrees. In: Bininda-Emonds O. R. P., editor. Phylogenetic Supertrees: combining information to reveal The Tree Of Life. Dordrecht (the Netherlands): Kluwer Academic. p. 227-246.
47. Wojciechowski M., Sanderson M., Steele K., Liston A. 2000. Molecular phylogeny of the "temperate herbaceous tribes" of papilionoid legumes: a supertree approach. Adv. Legume Syst. 9:277-298.
48. Zwickl D. 2006. GARLI download page. Website http://www.bio. utexas.edu/faculty/antisense/garli/Garli.html. (Accessed 2 October 2011).