基于距离的系统发育重建的序列长度要求：打破多项式障碍
Sequence-Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier
摘要：
我们介绍了一种新的基于距离的多项式重建技术，可证明实现，在足够短的分支长度，多对数序列长度的要求-显着提高了以前的多项式边界的距离为基础的方法。该技术是基于一个平均过程，隐含地重建祖先序列。在同样的道理，我们扩展以前的结果在一般的时间可逆模型的相变的同源重建。更确切地说，我们表明，在所谓的Kesten-Stigum区（粗略地说，一个区域的参数空间的祖先序列很好地近似“线性组合”的观察到的序列）序列长度$\poly(\log n)$足以重建时，分支长度离散化。这里$n$是现存物种的数量。我们的研究结果在一定程度上挑战了传统的观点，即单独估计进化距离比全序列数据集携带的关于遗传学的信息少得多。
英文摘要：
We introduce a new distance-based phylogeny reconstruction technique which provably achieves, at sufficiently short branch lengths, a polylogarithmic sequence-length requirement -- improving significantly over previous polynomial bounds for distance-based methods. The technique is based on an averaging procedure that implicitly reconstructs ancestral sequences. In the same token, we extend previous results on phase transitions in phylogeny reconstruction to general time-reversible models. More precisely, we show that in the so-called Kesten-Stigum zone (roughly, a region of the parameter space where ancestral sequences are well approximated by ``linear combinations'' of the observed sequences) sequences of length $\poly(\log n)$ suffice for reconstruction when branch lengths are discretized. Here $n$ is the number of extant species. Our results challenge, to some extent, the conventional wisdom that estimates of evolutionary distances alone carry significantly less information about phylogenies than full sequence datasets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
