Cargando…
On the optimality of the neighbor-joining algorithm
The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. From this point of view, NJ is "optimal" when the algorithm outputs the tree which minimizes the balanced minimum...
| Autores principales: | , , , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
BioMed Central
2008
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2430562/ https://www.ncbi.nlm.nih.gov/pubmed/18447942 http://dx.doi.org/10.1186/1748-7188-3-5 |