arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1410.2371cs.CCq-bio.PE
收藏

用多重线性序或系统树满足三元置换约束

Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees

Leo van Iersel, Steven Kelk, Nela Lekic, Simone Linz

摘要:

三元置换约束满足问题(CSP)由对称群S_3的子集Pi指定。这样的问题的一个实例由一组变量V和一组约束C组成,其中每个约束是来自V的不同元素的有序三元组。目标是在V上构造线性顺序α,使得对于C中的每个约束(a,b,c),由α引起的a,b,c的顺序在Pi中。排除对称性和平凡的情况下,有11个这样的问题,其复杂性是众所周知的。在这里,我们考虑问题的变体,表示为2-Pi,其中我们可以构造两个线性阶α和β,每个约束需要至少满足其中之一。我们给出了一个完整的复杂性分类的所有11个2-Pi的问题,观察到,在开关从一个到两个线性订单的复杂性景观的变化相当突然,硬度证明变得相当复杂。然后,我们专注于11个问题之一,特别是,这是密切相关的“2-毛毛虫兼容性”的问题,在遗传学文献。我们表明,这种特殊的CSP仍然很难在三个线性订单,也在生物相关的情况下,当我们交换三个线性订单的三个系统发育树,产生的“3树兼容性”的问题。由于这个问题的生物相关性,我们也给出了极值的结果,在最坏的情况下,满足一组根三重约束n叶标签的最小数量的树。

英文摘要:

A ternary permutation constraint satisfaction problem (CSP) is specified by a subset Pi of the symmetric group S_3. An instance of such a problem consists of a set of variables V and a set of constraints C, where each constraint is an ordered triple of distinct elements from V. The goal is to construct a linear order alpha on V such that, for each constraint (a,b,c) in C, the ordering of a,b,c induced by alpha is in Pi. Excluding symmetries and trivial cases there are 11 such problems, and their complexity is well known. Here we consider the variant of the problem, denoted 2-Pi, where we are allowed to construct two linear orders alpha and beta and each constraint needs to be satisfied by at least one of the two. We give a full complexity classification of all 11 2-Pi problems, observing that in the switch from one to two linear orders the complexity landscape changes quite abruptly and that hardness proofs become rather intricate. We then focus on one of the 11 problems in particular, which is closely related to the '2-Caterpillar Compatibility' problem in the phylogenetics literature. We show that this particular CSP remains hard on three linear orders, and also in the biologically relevant case when we swap three linear orders for three phylogenetic trees, yielding the '3-Tree Compatibility' problem. Due to the biological relevance of this problem we also give extremal results concerning the minimum number of trees required, in the worst case, to satisfy a set of rooted triplet constraints on n leaf labels.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑