Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
436966 | Theoretical Computer Science | 2006 | 8 Pages |
Abstract
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 . 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 and a lower bound were known.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics