On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
SIAM Journal on Computing
High-Performance Algorithm Engineering for Computational Phylogenetics
The Journal of Supercomputing - Special issue on computational issues in fluid dynamics optimization and simulation
A lower bound on the edge l∞ radius of Saitou and Nei's method for phylogenetic reconstruction
Information Processing Letters
Hi-index | 5.23 |
In this paper, we study the performance of Saitou and Nei's neighbor-joining method for phylogenetic reconstruction. We show that the edge l∞ radius of the method is 1/4. This improves an result by Atteson [The performance of neighbor-joining methods of phylogenetic reconstruction, Algorithmica 25 (1999) 251-278] and Xu et al. [A lower bound on the edge l∞ radius of Saitou and Nei's method for phylogenetic reconstruction, Inform. Process. Lett. 94(5) (2005) 225-230]. Previously, only an upper bound 1/4 and a lower bound 1/6 were known.