The performance of neighbor-joining methods of phylogenetic reconstruction
The performance of neighbor-joining methods of phylogenetic reconstruction
复制标题
DOI：
10.1007/pl00008277
复制
发表时间：
1999-10-01
期刊：
影响因子：
1.1
通讯作者：
Atteson, K
中科院分区：
文献类型：
--
作者：
Atteson, K
我们分析了流行的系统发育重建邻接方法的性能。特别是，我们找到了这些方法将确定正确的树拓扑的条件，并表明这些方法在某种意义上表现得尽可能好。当表明它们正确确定整个树拓扑的必要条件不成立时，我们还给出了这些方法的性能指示。我们使用这些结果来证明以高置信度重建拓扑所需的数据量的上限。
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine the correct tree topology and show that these perform as well as possible in a certain sense. We also give indications of the performance of these methods when the conditions necessary to show that they determine the entire tree topology correctly, do not hold. We use these results to demonstrate an upper bound on the amount of data necessary to reconstruct the topology with high confidence.