Cargando…
Recrafting the neighbor-joining method
BACKGROUND: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical Θ(n(3)) algorithm upon which all existing implementations are based. RESULTS: In this paper we present techniques for speedin...
Autores principales: | Mailund, Thomas, Brodal, Gerth S, Fagerberg, Rolf, Pedersen, Christian NS, Phillips, Derek |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2006
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3271233/ https://www.ncbi.nlm.nih.gov/pubmed/16423304 http://dx.doi.org/10.1186/1471-2105-7-29 |
Ejemplares similares
-
A practical O(n log(2 )n) time algorithm for computing the triplet distance on binary trees
por: Sand, Andreas, et al.
Publicado: (2013) -
Live neighbor-joining
por: Telles, Guilherme P., et al.
Publicado: (2018) -
Algorithms for Computing the Triplet Quartet Distances for Binary General Trees
por: Sand, Andreas, et al.
Publicado: (2013) -
Scaling neighbor joining to one million taxa with dynamic and heuristic neighbor joining
por: Clausen, Philip T L C
Publicado: (2022) -
On the optimality of the neighbor-joining algorithm
por: Eickmeyer, Kord, et al.
Publicado: (2008)