A carregar...
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...
Na minha lista:
| Main Authors: | , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
BioMed Central
2008
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC2430562/ https://ncbi.nlm.nih.gov/pubmed/18447942 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/1748-7188-3-5 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|