Parallel computation of phylogenetic consensus trees

Procedia Computer Science

Volumn 1, Issue 1, 2010, Pages 1065-1073

  Aberer, Andre J ^a   Pattengale, Nicholas D ^b   Stamatakis, Alexandros ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b University of New Mexico   (United States)

Author keywords

Majority rule tree; Multi core architecture; Phylogenetics; RAxML

Indexed keywords

COMPUTER ARCHITECTURE; SCALABILITY;

MAJORITY RULE; MULTICORE ARCHITECTURES; PARALLEL COMPUTATION; PHYLOGENETIC INFERENCE; PHYLOGENETIC TREE RECONSTRUCTION; PHYLOGENETICS; RAXML; SEQUENTIAL OPTIMIZATION;

TREES (MATHEMATICS);

EID: 78650288793     PISSN: None     EISSN: 18770509     Source Type: Conference Proceeding    
DOI: 10.1016/j.procs.2010.04.118     Document Type: Conference Paper

References (18)

1. M. Ronaghi, Pyrosequencing Sheds Light on DNA Sequencing, Genome Research 11 (1) (2001) 3-11.
2. J. Felsenstein, Evolutionary trees from DNA sequences: a maximum likelihood approach, J. Mol. Evol. 17 (1981) 368-376.
3. B. Chor, T. Tuller, Maximum likelihood of evolutionary trees: hardness and approximation, Bioinformatics 21 (1) (2005) 97-106.
4. A. Stamatakis, RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed models, Bioinformatics 22 (21) (2006) 2688-2690. doi:10.1093/bioinformatics/btl446.
5. D. Zwickl, Genetic Algorithm Approaches for the Phylogenetic Analysis of Large Biological Sequence Datasets under the Maximum Likelihood Criterion, Ph.D. thesis, University of Texas at Austin (April 2006).
6. S. Smith, M. Donoghue, Rates of Molecular Evolution Are Linked to Life History in Flowering Plants, Science 322 (5898) (2008) 86-89.
7. D. Bryant, A classification of consensus methods for phylogenetics.
8. J. Felsenstein, Phylip - phylogeny inference package (version 3.2), Cladistics 5 (1989) 164-166.
9. D. L. Swofford, Paup*. phylogenetic analysis using parsimony (*and other methods). version 4. (2003).
10. J. Felsenstein, Confidence Limits on Phylogenies: An Approach Using the Bootstrap, Evolution 39 (4) (1985) 783-791.
11. N. D. Pattengale, M. Alipour, O. R. Bininda-Emonds, B. M. Moret, A. Stamatakis, How many bootstrap replicates are necessary?, in: RECOMB 2'09: Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology, Springer- Verlag, Berlin, Heidelberg, 2009, pp. 184-200.
12. A. Stamatakis, M. Ott, Exploiting Fine-Grained Parallelism in the Phylogenetic Likelihood Function with MPI, Pthreads, and OpenMP: A Performance Study., in: M. Chetty, A. Ngom, S. Ahmad (Eds.), PRIB, Vol. 5265 of Lecture Notes in Computer Science, Springer, 2008, pp. 424-435.
13. S.-J. Sul, T. L. Williams, An experimental analysis of consensus tree algorithms for large-scale tree collections, in: Proceedings of 5th Intl. Symposium on Bioinformatics Research and Applications (ISBRA'09), Springer LNBI 5542, 2009, pp. 100-111.
14. D. L. Swofford, PAUP?: Phylogenetic analysis using parsimony (? and other methods), version 4.0b10, Sinauer Associates, 2002.
15. T. Margush, F. McMorris, Consensus n-trees, Bulletin of Mathematical Biology 43 (1981) 239-244.
16. P. Buneman, The recovery of trees from measures of dissimilarity, In D.G. Kendall and P. Tautu, editors, Mathematics the the Archeological and Historical Sciences (1971) 387-395.
17. N. D. Pattengale, E. J. Gottlieb, B. M. E. Moret, Efficiently computing the Robinson-Foulds metric, J. Comput. Biol. 14 (6) (2007) 724-735, special issue on best papers from RECOMB'06.
18. D. Gusfield, Efficient algorithms for inferring evolutionary trees, Networks 21 (1) (1991) 19-28.