Cargando…
Optimization strategies for fast detection of positive selection on phylogenetic trees
Motivation: The detection of positive selection is widely used to study gene and genome evolution, but its application remains limited by the high computational cost of existing implementations. We present a series of computational optimizations for more efficient estimation of the likelihood functi...
Autores principales: | Valle, Mario, Schabauer, Hannes, Pacher, Christoph, Stockinger, Heinz, Stamatakis, Alexandros, Robinson-Rechavi, Marc, Salamin, Nicolas |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3982156/ https://www.ncbi.nlm.nih.gov/pubmed/24389654 http://dx.doi.org/10.1093/bioinformatics/btt760 |
Ejemplares similares
-
Selectome update: quality control and computational improvements to a database of positive selection
por: Moretti, Sébastien, et al.
Publicado: (2014) -
RAxML Grove: an empirical phylogenetic tree database
por: Höhler, Dimitri, et al.
Publicado: (2021) -
Coev-web: a web platform designed to simulate and evaluate coevolving positions along a phylogenetic tree
por: Dib, Linda, et al.
Publicado: (2015) -
State aggregation for fast likelihood computations in molecular evolution
por: Davydov, Iakov I, et al.
Publicado: (2017) -
MPBoot: fast phylogenetic maximum parsimony tree inference and bootstrap approximation
por: Hoang, Diep Thi, et al.
Publicado: (2018)