On the optimality of the neighbor-joining algorithm
<p>Abstract</p> <p>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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
BMC
2008-04-01
|
| Series: | Algorithms for Molecular Biology |
| Online Access: | http://www.almob.org/content/3/1/5 |