An experimental study of Quartets MaxCut and other supertree methods

Algorithms for Molecular Biology

Volumn 6, Issue 1, 2011, Pages

  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

[No Author keywords available]

Indexed keywords

EID: 79955102024     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-6-7     Document Type: Article

References (28)

1. Baum BR. Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon 1992, 41:3-10.
2. Ragan MA. Phylogenetic inference based on matrix representation of trees. Mol Phylo Evol 1992, 1:53-58.
3. Bininda-Emonds ORP. The evolution of supertrees. Trends in Ecology and Evolution 2004, 19:315-322. 10.1016/j.tree.2004.03.015, 16701277.
4. Bininda-Emonds ORP. Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life 2004, Computational Biology, Kluwer Academic, Dordrecht, the Netherlands.
5. Ben-dor A, Chor B, Graur D, Ophir R, Pelleg D. Constructing phylogenies from quartets: elucidation of eutherian superordinal relationships. Journal of Computational Biology 1998, 5(3):377-390. [Earlier version appeared in RECOMB 1998], 10.1089/cmb.1998.5.377, 9773339.
6. Jiang T, Kearney P, Li M. A polynomial-time approximation scheme for inferring evolutionary trees from quartet topologies and its applications. SIAM J Comput 2001, 30(6):1924-1961.
7. Bolaender H, Fellows M, Warnow T. Two strikes against perfect phylogeny. Lecture Notes in Computer Science 1992, 623:273-283.
8. Dress A, Steel M. Convex tree realizations of partitions. Applied Mathematics Letters 1992, 5(3):3-6.
9. Strimmer K, von Haeseler A. Quartet Puzzling: A quartet maximum-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution 1996, 13(7):964-969.
10. Ranwez V, Gascuel O. Quartet-based phylogenetic inference: improvements and limits. Mol Biol Evol 2001, 18(6):1103-1116.
11. Jiang T, Kearney P, Li M. Orchestrating quartets: approximation and data correction. Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science 1998, 416-425. Motwani R, Los Alamitos, CA.
12. John KS, Warnow T, Moret BME, Vawter L. Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. Journal of Algorithms 2003, 48:173-193.
13. Snir S, Warnow T, Rao S. Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm. J Comput Biol 2008, 15:91-103. 10.1089/cmb.2007.0103, 18199023.
14. Snir S, Rao S. Quartets MaxCut: A Divide and Conquer Quartets Algorithm. IEEE/ACM Trans Comput Biol Bioinform 2010, 7(4):704-718.
15. Bansal M, Burleigh JG, Eulenstein O, Fernández-Baca D. Robinson-Foulds Supertrees. Algorithms for Molecular Biology 2010, 5:18. 10.1186/1748-7188-5-18, 2846952, 20181274.
16. Holland B, Conner G, Huber K, Moulton V. Imputing Supertrees and Supernetworks from Quartets. Syst Biol 2007, 57:299-308.
17. Chen D, Diao L, Eulenstein O, Fernández-Baca D, Sanderson MJ. Flipping: a supertree construction method. Bioconsensus, Volume 61 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science 2003, 135-160. American Mathematical Society-DIMACS, Providence, Rhode Island.
18. Burleigh JG, Eulenstein O, Fernández-Baca D, Sanderson MJ. MRF supertrees. Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life 2004, 65-86. Bininda-Emonds ORP, Kluwer Academic, Dordrecht, the Netherlands.
19. Chen D, Eulenstein O, Fernández-Baca D, Burleigh JG. Improved heuristics for minimum-flip supertree construction. Evol Bioinform 2006, 2:401-410.
20. Creevey CJ, McInerney JO. Clann: investigating phylogenetic information through supertree analyses. Bioinformatics 2005, 21(3):390-392. 10.1093/bioinformatics/bti020, 15374874.
21. Ranwez V, Berry V, Criscuolo A, Fabre PH, Guillemot S, Scornavacca C, Douzery EJP. PhySIC: a veto supertree method with desirable properties. Syst Biol 2007, 56(5):798-817. 10.1080/10635150701639754, 17918032.
22. Foulds LR, Graham RL. The Steiner problem in phylogeny is NP-complete. Adv in Appl Math 1982, 3(43-49):299.
23. Swenson MS, Barbançon F, Warnow T, Linder CR. A simulation study comparing supertree and combined analysis methods using SMIDGen. Algorithms for Molecular Biology 2010, 5:8. 10.1186/1748-7188-5-8, 2837663, 20047664.
24. Swofford DL, Olson GJ, Waddell PJ, Hillis DM. Phylogenetic Inference 1996, 407-425. Sinauer Associates, Sunderland, Massachusetts, 2.
25. Stamatakis A. RAxML-VI-HPC: Maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics 2006, 22:2688-2690. 10.1093/bioinformatics/btl446, 16928733.
26. Nixon KC. The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics 1999, 15:407-414.
27. Rannala B, Huelsenbeck JP, Yang Z, Neilsen R. Taxon Sampling and the Accuracy of Large Phylogenies. Syst Biol 1998, 47:702-710. 10.1080/106351598260680, 12066312.
28. Thain D, Tannenbaum T, Livny M. Distributed computing in practice: the Condor experience. Concurrency and Computation: Practice and Experience 2005, 17:323-356.