Cargando…
Scaling neighbor joining to one million taxa with dynamic and heuristic neighbor joining
MOTIVATION: The neighbor-joining (NJ) algorithm is a widely used method to perform iterative clustering and forms the basis for phylogenetic reconstruction in several bioinformatic pipelines. Although NJ is considered to be a computationally efficient algorithm, it does not scale well for datasets e...
Autor principal: | Clausen, Philip T L C |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9805563/ https://www.ncbi.nlm.nih.gov/pubmed/36453849 http://dx.doi.org/10.1093/bioinformatics/btac774 |
Ejemplares similares
-
Live neighbor-joining
por: Telles, Guilherme P., et al.
Publicado: (2018) -
On the optimality of the neighbor-joining algorithm
por: Eickmeyer, Kord, et al.
Publicado: (2008) -
Recrafting the neighbor-joining method
por: Mailund, Thomas, et al.
Publicado: (2006) -
Combinatorial and Computational Investigations of Neighbor-Joining Bias
por: Davidson, Ruth, et al.
Publicado: (2020) -
DrTransformer: heuristic cotranscriptional RNA folding using the nearest neighbor energy model
por: Badelt, Stefan, et al.
Publicado: (2023)