Cargando…
Efficient Detection of Repeating Sites to Accelerate Phylogenetic Likelihood Calculations
The phylogenetic likelihood function (PLF) is the major computational bottleneck in several applications of evolutionary biology such as phylogenetic inference, species delimitation, model selection, and divergence times estimation. Given the alignment, a tree and the evolutionary model parameters,...
Autores principales: | Kobert, K., Stamatakis, A., Flouri, T. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5837535/ https://www.ncbi.nlm.nih.gov/pubmed/27576546 http://dx.doi.org/10.1093/sysbio/syw075 |
Ejemplares similares
-
An optimal algorithm for computing all subtree repeats in trees
por: Flouri, T., et al.
Publicado: (2014) -
The Phylogenetic Likelihood Library
por: Flouri, T., et al.
Publicado: (2015) -
Multi-rate Poisson tree processes for single-locus species delimitation under maximum likelihood and Markov chain Monte Carlo
por: Kapli, P, et al.
Publicado: (2017) -
RAxML-NG: a fast, scalable and user-friendly tool for maximum likelihood phylogenetic inference
por: Kozlov, Alexey M, et al.
Publicado: (2019) -
PEAR: a fast and accurate Illumina Paired-End reAd mergeR
por: Zhang, Jiajie, et al.
Publicado: (2014)