Cargando…
Fast algorithms for computing phylogenetic divergence time
BACKGROUND: The inference of species divergence time is a key step in most phylogenetic studies. Methods have been available for the last ten years to perform the inference, but the performance of the methods does not yet scale well to studies with hundreds of taxa and thousands of DNA base pairs. F...
Autores principales: | Crosby, Ralph W., Williams, Tiffani L. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5731500/ https://www.ncbi.nlm.nih.gov/pubmed/29244015 http://dx.doi.org/10.1186/s12859-017-1916-1 |
Ejemplares similares
-
An efficient and extensible approach for compressing phylogenetic trees
por: Matthews, Suzanne J, et al.
Publicado: (2011) -
Fast Computations for Measures of Phylogenetic Beta Diversity
por: Tsirogiannis, Constantinos, et al.
Publicado: (2016) -
Using tree diversity to compare phylogenetic heuristics
por: Sul, Seung-Jin, et al.
Publicado: (2009) -
A New Support Measure to Quantify the Impact of Local Optima in Phylogenetic Analyses
por: Brammer, Grant, et al.
Publicado: (2011) -
Fast and efficient algorithms in computational electromagnetics
por: Chew, W C, et al.
Publicado: (2001)