An experimental study of quartets MaxCut and other supertree methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6293 LNBI, Issue , 2010, Pages 288-299

  Swenson, M Shel ^a,b   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

DATA SETS; EXPERIMENTAL STUDIES; MATRIX REPRESENTATION; MAX-CUT; REALISTIC MODEL; SOURCE TREE; SUPERTREE; TOPOLOGICAL DISTANCE;

HIGH ENERGY PHYSICS; TOPOLOGY; FORESTRY;

BIOINFORMATICS;

EID: 78049481079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15294-8_24     Document Type: Conference Paper

References (27)

1. Bansal, M., Burleigh, J.G., Eulenstein, O., Fernández-Baca, D.: Robinson-foulds supertrees (2009)
2. Baum, B.R.: Combining trees as a way of combining data sets for phylogenetic inference, and the desirability of combining gene trees. Taxon 41, 3-10 (1992)
3. Ben-dor, A., Chor, B., Graur, D., Ophir, R., Pelleg, D.: Constructing phylogenies from quartets: Elucidation of eutherian superordinal relationships. Journal of Computational Biology 5(3), 377-390 (1998),
4. Earlier version appeared in RECOMB 1998 (1998)
5. Bininda-Emonds, O.R.P.: The evolution of supertrees. Trends in Ecology and Evolution 19, 315-322 (2004)
6. Bininda-Emonds, O.R.P.: Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life. Computational Biology. Kluwer Academic, Dordrecht (2004)
7. Bolaender, H., Fellows, M., Warnow, T.: Two strikes against perfect phylogeny. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 273-283. Springer, Heidelberg (1992)
8. Burleigh, J.G., Eulenstein, O., Fernández-Baca, D., Sanderson, M.J.: MRF supertrees. In: Bininda-Emonds, O.R.P. (ed.) Phylogenetic Supertrees: Combining Information To Reveal The Tree Of Life, pp. 65-86. Kluwer Academic, Dordrecht (2004)
9. Chen, D., Diao, L., Eulenstein, O., Fernández-Baca, D., Sanderson, M.J.: Flipping: a supertree construction method. In: Bioconsensus. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol. 61, pp. 135-160. American Mathematical Society- DIMACS, Providence (2003)
10. Chen, D., Eulenstein, O., Fernández-Baca, D., Burleigh, J.G.: Improved heuristics for minimum-flip supertree construction. Evol. Bioinform. 2, 401-410 (2006)
11. Creevey, C.J., McInerney, J.O.: Clann: investigating phylogenetic information through supertree analyses. Bioinformatics 21(3), 390-392 (2005)
12. Dress, A., Steel, M.: Convex tree realizations of partitions. Applied Mathematics Letters 5(3), 3-6 (1992)
13. Foulds, L.R., Graham, R.L.: The steiner problem in phylogeny is NP-complete. Adv. in Appl. Math. 3(43-49), 299 (1982)
14. Holland, B., Conner, G., Huber, K., Moulton, V.: Imputing supertrees and supernetworks from quartets. Syst. Biol. 57(1), 299-308 (2007)
15. Jiang, T., Kearney, P., Li, M.: Orchestrating quartets: approximation and data correction. In: Motwani, R. (ed.) Proceedings of the 39th IEEE Annual Symposium on Foundations of Computer Science, Los Alamitos, CA., pp. 416-425 (1998)
16. Jiang, T., Kearney, P., Li, M.: A polynomial-time approximation scheme for inferring evolutionary trees from quartet topologies and its applications. SIAM J. Comput. 30(6), 1924-1961 (2001)
17. John, K.S., Warnow, T., Moret, B.M.E., Vawter, L.: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. Journal of Algorithms 48, 173-193 (2003)
18. Nixon, K.C.: The parsimony ratchet, a new method for rapid parsimony analysis. Cladistics 15, 407-414 (1999)
19. Ragan, M.A.: Phylogenetic inference based on matrix representation of trees. Mol. Phylo. Evol. 1, 53-58 (1992)
20. 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. Syst. Biol. 56(5), 798-817 (2007)
21. Ranwez, V., Gascuel, O.: Quartet-Based phylogenetic inference: Improvements and limits. Mol. Biol. Evol. 18(6), 1103-1116 (2001)
22. Snir, S., Rao, S.: Quartets MaxCut: a divide and conquer quartets algorithm. IEEE/ACM Trans. Comput. Biol. Bioinform. (2008)
23. Snir, S., Warnow, T., Rao, S.: Short quartet puzzling: A new Quartet-Based phylogeny reconstruction algorithm. J. Comput. Biol. 15(1), 91-103 (2008)
24. Stamatakis, A.: RAxML-NI-HPC: Maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models. Bioinformatics 22, 2688-2690 (2006)
25. Strimmer, K., von Haeseler, A.: Quartet puzzling: A quartet maximim-likelihood method for reconstructing tree topologies. Molecular Biology and Evolution 13(7), 964-969 (1996) (Pubitemid 26284912)
26. Swenson, M.S., Barbançon, F., Warnow, T., Linder, C.R.: A simulation study comparing supertree and combined analysis methods using SMIDGen. Algorithms for Molecular Biology 5, 8 (2010)
27. Thain, D., Tannenbaum, T., Livny, M.: Distributed computing in practice: the Condor experience. Concurrency and Computation: Practice and Experience 17, 323-356 (2005)