constNJ:一种满足两两拓扑约束的系统发育树集重构算法
constNJ: an algorithm to reconstruct sets of phylogenetic trees satisfying pairwise topological constraints
摘要:
本文介绍了constNJ,第一个算法的系统发育重建的树集与约束成对有根子树修剪嫁接(rSPR)的距离。我们的动机是构建必须适合重组、杂交或类似网络的树集的问题。constNJ不是首先根据系统发育标准(例如似然性或简约性)找到一组最佳的树,然后尝试将它们拟合到网络中,而是在执行指定的rSPR距离约束的同时估计树。constNJ的主要输入是从序列块导出的距离矩阵的集合,所述序列块被假设为以树状方式进化,例如不包含任何重组断点的比对块。另一个输入是一组rSPR约束,用于任何一组成对的树。constNJ是一致的,是邻居连接算法的严格推广;它使用了“最大一致性分区”的新概念来确保生成的树满足给定的rSPR距离约束。
英文摘要:
This paper introduces constNJ, the first algorithm for phylogenetic reconstruction of sets of trees with constrained pairwise rooted subtree-prune regraft (rSPR) distance. We are motivated by the problem of constructing sets of trees which must fit into a recombination, hybridization, or similar network. Rather than first finding a set of trees which are optimal according to a phylogenetic criterion (e.g. likelihood or parsimony) and then attempting to fit them into a network, constNJ estimates the trees while enforcing specified rSPR distance constraints. The primary input for constNJ is a collection of distance matrices derived from sequence blocks which are assumed to have evolved in a tree-like manner, such as blocks of an alignment which do not contain any recombination breakpoints. The other input is a set of rSPR constraints for any set of pairs of trees. ConstNJ is consistent and a strict generalization of the neighbor-joining algorithm; it uses the new notion of "maximum agreement partitions" to assure that the resulting trees satisfy the given rSPR distance constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。