Taxon sampling versus computational complexity and their impact on obtaining the tree of life

Reconstructing the Tree of Life: Taxonomy and Systematics of Species Rich Taxa

Volumn , Issue , 2006, Pages 77-95

  Bininda Emonds, O R P ^a   Stamatakis, A ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84986251481     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420009538     Document Type: Chapter

References (52)

1. Rokas, A. and Carroll, S.B., More genes or more taxa? The relative contribution of gene number and taxon number to phylogenetic accuracy, Mol. Biol. Evol., 22, 1337, 2005.
2. Bininda-Emonds, O.R.P., Supertree construction in the genomic age, in Molecular Evolution: Producing the Biochemical Data, part B, Zimmer, E.A. and Roalson, E., Eds., Methods in Enzymology, Vol. 395, Elsevier, Amsterdam, 2005, 745.
3. Sanderson, M.J. and Driskell, A.C., The challenge of constructing large phylogenetic trees, Trends Pl. Sci., 8, 374, 2003.
4. Wilson, E.O., Taxonomy as a fundamental discipline, Philos. Trans. R. Soc. Lond. B, 359, 739, 2004.
5. Felsenstein, J., The number of evolutionary trees, Syst. Zool., 27, 27, 1978.
6. Mailund, T. and Pedersen, C.N., QuickJoin: fast neighbour-joining tree reconstruction, Bioinformatics, 20, 3261, 2004.
7. Stamatakis, A., Parallel inference of a 10,000-taxon phylogeny with maximum likelihood, in Proceedings of 10th International Euro-Par Conference (Euro-Par 2004), Springer Verlag, 2004, 997.
8. Coarfa, C. et al., PRec-I-DCM3: a parallel framework for fast and accurate large scale phylogeny reconstruction, in The First IEEE Workshop on High Performance Computing in Medicine and Biology (HiPCoMP 2005), Fukuoka, Japan, 2005.
9. Roshan, U. et al., Rec-I-DCM3: a fast algorithmic technique for reconstructing large phylogenetic trees, in Proceedings of the IEEE Computational Systems Bioinformatics conference (CSB), IEEE Computer Society Press, Stanford, California, 2004.
10. Garey, M.R. and Johnson, D.S., Computers and Intractability: a Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco, 1979.
11. Salamin, N., Hodkinson, T.R., and Savolainen, V., Towards building the tree of life: a simulation study for all angiosperm taxa, Syst. Biol., 54, 183, 2005.
12. Hillis, D.M., Inferring complex phylogenies, Nature, 383, 130, 1996.
13. Bininda-Emonds, O.R.P. et al., Scaling of accuracy in extremely large phylogenetic trees, in Pacific Symposium on Biocomputing 2001, Altman, R.B. et al., Eds., World Scientific Publishing Company, River Edge, NJ, 2000, 547.
14. Erdös, P.L. et al., A few logs suffice to build (almost) all trees (I), Random Struc. Alg., 14, 153, 1999.
15. Erdös, P.L. et al., A few logs suffice to build (almost) all trees: part II, Theoret. Comput. Sci., 221, 77, 1999.
16. Huelsenbeck, J.P. and Hillis, D.M., Success of phylogenetic methods in the four-taxon case, Syst. Biol., 42, 247, 1993.
17. Bergsten, J., A review of long-branch attraction, Cladistics, 21, 163, 2005.
18. Hillis, D.M., Taxonomic sampling, phylogenetic accuracy, and investigator bias, Syst. Biol., 47, 3, 1998.
19. Pollock, D.D. et al., Increased taxon sampling is advantageous for phylogenetic inference, Syst. Biol., 51, 664, 2002.
20. Graybeal, A., Is it better to add taxa or characters to a difficult phylogenetic problem? Syst. Biol., 47, 9, 1998.
21. Rosenberg, M.S. and Kumar, S., Incomplete taxon sampling is not a problem for phylogenetic inference, Proc. Natl. Acad. Sci. USA, 98, 10751, 2001.
22. Strimmer, K. and von Haeseler, A., Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies, Mol. Biol. Evol., 13, 964, 1996.
23. Huson, D.H., Nettles, S.M., and Warnow, T.J., Disk-covering, a fast-converging method for phylogenetic tree reconstruction, J. Comput. Biol., 6, 369, 1999.
24. Huson, D.H., Vawter, L., and Warnow, T.J., Solving large scale phylogenetic problems using DCM2, in Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology, Lengauer, T. et al., Eds., AAAI Press, Menlo Park, California, 1999, 118.
25. Sanderson, M.J., r8s: inferring absolute rates of molecular evolution and divergence times in the absence of a molecular clock, Bioinformatics, 19, 301, 2003.
26. Rambaut, A. and Grassly, N.C., Seq-Gen: an application for the Monte Carlo simulation of DNA sequence evolution along phylogenetic trees, Comput. Appl. Biosci., 13, 235, 1997.
27. Swofford, D.L. et al., Phylogenetic inference, in Molecular Systematics, Hillis, D.M., Moritz, C., and Mable, B.K., Eds., Sinauer Associates, Sunderland, Massachusetts, 1996, 407.
28. Roshan, U. et al., Performance of supertree methods on various data set decompositions, in Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life, Bininda-Emonds, O.R.P., Ed., Kluwer Academic, Dordrecht, Netherlands, 2004, 301.
29. Stamatakis, A., Ludwig, T., and Meier, H., New, fast and accurate heuristics for inference of large phylogenetic trees, in Proceedings of 18th IEEE/ACM International Parallel and Distributed Processing Symposium (IPDPS2004), High Performance Computational Biology Workshop, IEEE Computer Society, Santa Fe, New Mexico, 2004.
30. Swofford, D.L., PAUP*. Phylogenetic Analysis Using Parsimony (*and Other Methods). Version 4, Sinauer Associates, Sunderland, MA, 2002.
31. Nixon, K.C., The parsimony ratchet, a new method for rapid parsimony analysis, Cladistics, 15, 407, 1999.
32. Howe, K., Bateman, A., and Durbin, R., QuickTree: building huge neighbour-joining trees of protein sequences, Bioinformatics, 18, 1546, 2002.
33. Stamatakis, A., Ludwig, T., and Meier, H., RAxML-III: a fast program for maximum likelihood-based inference of large phylogenetic trees, Bioinformatics, 21, 456, 2005.
34. Stamatakis, A.P. et al., AxML: a fast program for sequential and parallel phylogenetic tree calculations based on the maximum likelihood method, Proc. IEEE Comput. Soc. Bioinform. Conf., 1, 21, 2002.
35. Colless, D.H., Congruence between morphometric and allozyme data for Menidia species: a reappraisal, Syst. Zool., 29, 288, 1980.
36. Colless, D.H., Predictivity and stability in classifications: some comments on recent studies, Syst. Zool., 30, 325, 1981.
37. Robinson, D.F. and Foulds, L.R., Comparison of phylogenetic trees, Math. Biosci., 53, 131, 1981.
38. Steel, M., The complexity of reconstructing trees from qualitative characters and subtrees, J. Classif., 9, 91, 1992.
39. Rokas, A. et al., Genome-scale approaches to resolving incongruence in molecular phylogenies, Nature, 425, 798, 2003.
40. Hillis, D.M., Huelsenbeck, J.P., and Cunningham, C.W., Application and accuracy of molecular phylogenies, Science, 264, 671, 1994.
41. Guindon, S. and Gascuel, O., A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood, Syst. Biol., 52, 696, 2003.
42. Rogers, J.S. and Swofford, D.L., Multiple local maxima for likelihoods of phylogenetic trees: a simulation study, Mol. Biol. Evol., 16, 1079, 1999.
43. Goloboff, P.A., Analyzing large data sets in reasonable times: solutions for composite optima, Cladistics, 15, 415, 1999.
44. Salamin, N. et al., Assessing internal support with large phylogenetic DNA matrices, Mol. Phylogenet. Evol., 27, 528, 2003.
45. Hasegawa, M. and Kishino, H., Accuracies of the simple methods for estimating the bootstrap probability of a maximum-likelihood tree, Mol. Biol. Evol., 11, 142, 1994.
46. Kishino, H., Miyata, T., and Hasegawa, M., Maximum likelihood inference of protein phylogeny and the origin of chloroplasts, J. Mol. Evol., 31, 151, 1990.
47. Waddell, P.J., Kishino, H., and Ota, R., Very fast algorithms for evaluating the stability of ML and Bayesian phylogenetic trees from sequence data, in Genome Informatics 2002, Lathrop, R. et al., Eds., Universal Academy Press, Tokyo, 2002, 82.
48. Kim, J., General inconsistency conditions for maximum parsimony: effects of branch lengths and increasing numbers of taxa, Syst. Biol., 45, 363, 1996.
49. le Vinh, S. and Von Haeseler, A., IQPNNI: moving fast through tree space and stopping in time, Mol. Biol. Evol., 21, 1565, 2004.
50. Du, Z. et al., Parallel divide-and-conquer phylogeny reconstruction by maximum likelihood, in High Performance Computing and Communications: First International Conference, HPCC 2005, Sorrento, Italy, September, 21-23, 2005, Proceedings, Dongarra, J. et al., Eds., Springer Verlag, Berlin, 2005, 776.
51. Bininda-Emonds, O.R.P. and Sanderson, M.J., Assessment of the accuracy of matrix representation with parsimony supertree construction, Syst. Biol., 50, 565, 2001.
52. Roshan, U., Fast Algorithmic Techniques for Large Scale Phylogenetic Reconstruction, Ph.D. thesis, University of Texas at Austin, 2004.