Short Quartet Puzzling: A new quartet-based phylogeny reconstruction algorithm

Journal of Computational Biology

Volumn 15, Issue 1, 2008, Pages 91-103

  Snir, Sagi ^a   Warnow, Tandy ^b   Rao, Satish ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Texas at Austin   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Biology; Computational molecular biology; Evolution

Indexed keywords

ALGORITHM; ARTICLE; PARSIMONY ANALYSIS; PHYLOGENY; PRIORITY JOURNAL; SIMULATION;

ALGORITHMS; ANIMALS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; PHYLOGENY; TIME FACTORS;

EID: 39449105691     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2007.0103     Document Type: Article

References (23)

1. Berry, V., Jiang, T., Kearney, P., et al. 1999. Quartet cleaning: improved algorithms and simulations. Eur. Symp. Algorithms, 313-324.
2. Erdös, P.L., Steel, M., Székely, L.A., et al. 1997. Constructing big trees from short sequences. Lect. Notes Comput. Sci. 1256, 827-837,
3. Erdos, P.L., Steel, M.A., Szekely, L., et al. 1999a. A few logs suffice to build (almost) all trees (i). Random Struct. Algorithms 14, 153-184.
4. Erdos, P.L., Steel, M.A., Szekely, L., et al. 1999b. A few logs suffice to build (almost) all trees (ii). Theoret. Comput. Sci. 221, 77-118.
5. Eulenstein, O., Chen, D., Burleigh, J.G., et al. 2004. Performance of flip supertrees with a heuristic algorithm. Syst. Biol. 53, 299-308.
6. Garey, M.R., and Johnson, D.S. 1979. Computers and Intractability; A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco.
7. Huson, D.H., Nettles, S., and Warnow, T. 1999. Disk-covering, a fast-converging method for phylogenetic tree reconstruction. J. Comput. Biol. 6, 369-386.
8. Jukes, T.H., and Cantor, C.R. 1969. Evolution of protein molecules, 21-132. In: Munro, H.N., ed., Mammalian Protein Metabolism. Academic Press, New York.
9. Kimura, M. 1980. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J. Mol. Evol. 17, 111-120.
10. Rannala, B., Huelsenbeck, J.P., Yang, Z., et al. 1998. Taxon sampling and the accuracy of large phylogenies. Syst. Biol. 47, 702-710.
11. Ranwez, V., and Gascuel, O. 2001. Quartet-based phylogenetic inference: improvements and limits. Mol. Biol. Evol. 18, 1103-1116.
12. Saitou, N., and Nei, M. 1987. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4, 406-425.
13. Sanderson, M. 2007. r8s. Available at: http://ginger.ucdavis.edu/r8s/ . Accessed December 1, 2007.
14. Schmidt, H.A., Strimmer, K., Vingron, M., et al. 2002. Tree-puzzle: maximum likelihood phylogenetic analysis using quartets and parallel computing. Bioinformatics 18, 502-504.
15. Semple, C., and Steel, M. 2000. A supertree method for rooted trees. Discrete Appl. Math. 103, 147-158.
16. Snir, S., and Rao, S. 2007. Quartets maxcut: a divide and conquer quartets algorithm (submitted).
17. St. John, K., Warnow, T., Moret, B.M.E., et al. 2001. Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. Proc. Sixth Annu. ACM-SIAM Symp. Discrete Algorithms, 196-205.
18. Stamatakis, A., Ludwig, T., and Meier, H. 2005. RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees. Bioinformatics 21, 456-463.
19. Steel, M.A. 1994. Recovering a tree from the leaf colourations it generates under a Markov model. Appl. Math. Lett. 7, 19-24.
20. Strimmer, K., Goldman, N., and von Haeseler, A. 1997. Bayesian probabilities and quartet puzzling. Mol. Biol. Evol. 14, 210-211.
21. Strimmer, K., and von Haeseler, A. 1996. Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Mol. Biol. Evol. 13,964-969.
22. Zwickl, D. 2006. GARLI download page. Available at: www.zo.utexas.edu/ faculty/antisense/Garli.html. Accessed December 1, 2007.
23. Zwickl, D., and Hillis, D. 2002. Increased taxon sampling greatly reduces phylogenetic error. Syst. Biol. 51, 588-598.