使用禁止的中间体排序
Sorting With Forbidden Intermediates
摘要：
广泛的应用，最显著的是在比较基因组学中，涉及对给定排列的操作的最短排序序列的计算，其中允许的操作的集合预先固定。这样的序列是有用的，例如当重建物种之间的进化的潜在场景，或当试图评估它们的相似性。我们通过在待计算的序列上添加一个新的约束来重新审视这些问题：它们必须是给定的一组\emph{forbidden intermediates}，这对应于不可能存在的物种，因为在它们的创建中涉及的突变是致命的。我们开始这项研究的情况下，唯一的突变，可以发生的是交换的任何两个元素的排列，并给出了一个多项式时间算法来解决这个问题时，排列排序是一个对合。
英文摘要：
A wide range of applications, most notably in comparative genomics, involve the computation of a shortest sorting sequence of operations for a given permutation, where the set of allowed operations is fixed beforehand. Such sequences are useful for instance when reconstructing potential scenarios of evolution between species, or when trying to assess their similarity. We revisit those problems by adding a new constraint on the sequences to be computed: they must \emph{avoid} a given set of \emph{forbidden intermediates}, which correspond to species that cannot exist because the mutations that would be involved in their creation are lethal. We initiate this study by focusing on the case where the only mutations that can occur are exchanges of any two elements in the permutations, and give a polynomial time algorithm for solving that problem when the permutation to sort is an involution.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
