A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
Maastricht University(马斯特里赫特大学);Delft University of Technology(代尔夫特理工大学)
Steven Kelk, Ruben Meuwese, Leo van Iersel
备注:
Under revision at journal. Compared to V2: new figures in Lemma 2, extended conclusion, fixed an error in the tightness constructions, several small typos fixed
针对多个二叉树的最大一致森林问题,通过改进链约简规则,得到每个树的叶子数为O(t * r * k)的核,其中k为参数,r=min{max{k,3},t+1},这是t>2时的首个核。
摘要:
系统发育学中的最大一致森林(MAF)问题输入为同一分类集X上的t≥2个二叉树T,要求将X划分为最少数量的块,使得这些块诱导的子树在所有树中不相交且具有共同拓扑。我们修改了著名的链约简规则,证明在穷举应用约简规则后,每个树的叶子数为O(t * r * k),其中k是自然参数(块数),r=min{max{k,3},t+1}。我们证明了该界适用于无根和有根版本的问题,并证明了公共链被截断的长度r是紧的。我们的结果是t>2情况下MAF的首个核。
英文摘要:
The maximum agreement forest (MAF) problem in phylogenetics takes as input a set t >= 2 of binary phylogenetic trees T on the same set of taxa X. It asks for a partition of X into the smallest number of blocks such that the subtrees induced by these blocks are disjoint and have common topology across all the trees in T. We produce a modified version of the well-known chain reduction rule in order to prove that after exhaustive application of reduction rules each tree has O( t * r * k ) leaves, where k is the natural parameter (the number of blocks) and r=min{max{k,3},t+1}}. We prove this bound for both the unrooted and rooted version of the problem, and demonstrate that the bound r, the length to which common chains are truncated, is tight. Our results constitute the first kernels for MAF in the t>2 regime.
Deep kernelization for the Tree Bisection and Reconnnect (TBR) distance in phylogenetics
我们描述了一个大小为9 k-8的核计算两个无根二元系统发育树之间的树二分法和重构(TBR)距离k的NP-难题。我们实现这一目标,通过扩展现有的组合的减少规则与三个新的减少规则。两个规则是基于拓扑变换的树的距离保持的方式,以保证执行较早的减少规则的想法。第三条规则将(Kelk和Linz,Annals of Combinatorics 24(3),2020)中引入的局部邻域方法扩展到更全局的结构,允许在删除叶子时确定新的情况,从而将TBR距离减少1。核大小的界紧到加性项。我们的研究结果也适用于计算两个无根二元系统发生树之间的最大协议森林(MAF)的等价问题。我们预计,我们的研究结果将更广泛地适用于计算协议森林为基础的相异性措施。