On the complexity of distance-based evolutionary tree reconstruction
On the complexity of distance-based evolutionary tree reconstruction
复制标题
DOI：
--
复制
发表时间：
2003-01
期刊：
影响因子：
--
通讯作者：
Valerie King;Li Zhang;Yunhong Zhou
中科院分区：
文献类型：
--
作者：
Valerie King;Li Zhang;Yunhong Zhou
We give the first tight lower bounds on the complexity of reconstructing k-ary evolutionary trees from additive distance data. We also consider the problem under DNA-based distance estimation assumptions, where the accuracy of distance data depends on the length of the sequence and the distance. We give the first o(n2) algorithm to reconstruct trees in this context, and prove a trade-off between the length of the DNA sequences and the number of distance queries needed to reconstruct the tree. We introduce new computational models for understanding this problem, which simplify the development of algorithms. We prove lower bounds in these models which apply to the type of techniques currently in use.
