TY - JOUR
T1 - On the edge l∞ radius of Saitou and Nei's method for phylogenetic reconstruction
AU - Dai, Wenqiang
AU - Xu, Yinfeng
AU - Zhu, Binhai
PY - 2006/12/15
Y1 - 2006/12/15
N2 - 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 frac(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 frac(1, 4) and a lower bound frac(1, 6) were known.
AB - 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 frac(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 frac(1, 4) and a lower bound frac(1, 6) were known.
KW - Evolutionary trees
KW - Neighbor-joining
KW - Phylogenetic reconstruction
UR - https://www.scopus.com/pages/publications/33750988515
U2 - 10.1016/j.tcs.2006.08.044
DO - 10.1016/j.tcs.2006.08.044
M3 - 文章
AN - SCOPUS:33750988515
SN - 0304-3975
VL - 369
SP - 448
EP - 455
JO - Theoretical Computer Science
JF - Theoretical Computer Science
IS - 1-3
ER -