Algorithms, data structures, and numerics for likelihood-based phylogenetic inference of huge trees
Open Access
- 13 December 2011
- journal article
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (1) , 470
- https://doi.org/10.1186/1471-2105-12-470
Abstract
The rapid accumulation of molecular sequence data, driven by novel wet-lab sequencing technologies, poses new challenges for large-scale maximum likelihood-based phylogenetic analyses on trees with more than 30,000 taxa and several genes. The three main computational challenges are: numerical stability, the scalability of search algorithms, and the high memory requirements for computing the likelihood.Keywords
This publication has 29 references indexed in Scilit:
- Time and memory efficient likelihood-based tree searches on phylogenomic alignments with missing dataBioinformatics, 2010
- New Algorithms and Methods to Estimate Maximum-Likelihood Phylogenies: Assessing the Performance of PhyML 3.0Systematic Biology, 2010
- INDELible: A Flexible Simulator of Biological Sequence EvolutionMolecular Biology and Evolution, 2009
- Mega-phylogeny approach for comparative biology: an alternative to supertree and supermatrix approachesBMC Ecology and Evolution, 2009
- Efficient computation of the phylogenetic likelihood function on multi-gene alignments and multi-core architecturesPhilosophical Transactions Of The Royal Society B-Biological Sciences, 2008
- Recent developments in the MAFFT multiple sequence alignment programBriefings in Bioinformatics, 2008
- BEAST: Bayesian evolutionary analysis by sampling treesBMC Ecology and Evolution, 2007
- RAxML-VI-HPC: maximum likelihood-based phylogenetic analyses with thousands of taxa and mixed modelsBioinformatics, 2006
- MUSCLE: multiple sequence alignment with high accuracy and high throughputNucleic Acids Research, 2004
- Evolutionary trees from DNA sequences: A maximum likelihood approachJournal of Molecular Evolution, 1981