人不能总是变成老鼠:对称反转排序的决策算法和复杂性
Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals
摘要:
排列的反转排序是基因组重排中的一个著名问题。自1997年以来,大量的生物学证据表明,在许多基因组中,反向区域的两侧通常是一对反向重复序列。这种类型的反转被称为对称反转,不幸的是,直到最近才在很大程度上被忽视。在本文中,我们研究了对称反转排序的问题,它需要一系列的对称反转将一个染色体$A$转换成另一个染色体$B$。通过对称反转排序的决策问题被称为{ \em SSR}(当输入染色体$A$和$B$被给出时,我们使用{ \em SSR(A,B)})和相应的优化版本(即,当对{ \em SSR(A,B)}的回答为是时,使用最小数量的对称反转将$A$转换为$B$)被称为{ \em SMSR(A,B)}。本文的主要结果总结如下,其中输入是一对染色体$A$和具有$n$重复的$B$。(1)我们提出了一个求解决策问题{ \em SSR(A,B)}的$O(n^2)$时间算法,即,确定染色体$A$是否可以通过一系列对称反转转化为$B$。(2)我们设计了一个$O(n^2)$时间算法来处理一个特殊的2-平衡情形{ \em SMSR(A,B)},其中染色体$A$和$B$都有重复数2,并且每个重复在$A$和$B$中以不同的方向出现两次. (3)我们表明,SMSR是NP难的,即使输入染色体的重复数最多为2,从而表明上述正优化结果是最好的可能。作为一个副产品,我们表明,\emph{minimum Steiner tree}问题的\emph{circle graphs}是NP难的,解决了38岁的开放问题的复杂性状态。
英文摘要:
Sorting a permutation by reversals is a famous problem in genome rearrangements. Since 1997, quite some biological evidence were found that in many genomes the reversed regions are usually flanked by a pair of inverted repeats. This type of reversals are called symmetric reversals, which, unfortunately, were largely ignored until recently. In this paper, we investigate the problem of sorting by symmetric reversals, which requires a series of symmetric reversals to transform one chromosome $A$ into the another chromosome $B$. The decision problem of sorting by symmetric reversals is referred to as {\em SSR} (when the input chromosomes $A$ and $B$ are given, we use {\em SSR(A,B)}) and the corresponding optimization version (i.e., when the answer for {\em SSR(A,B)} is yes, using the minimum number of symmetric reversals to convert $A$ to $B$), is referred to as {\em SMSR(A,B)}. The main results of this paper are summarized as follows, where the input is a pair of chromosomes $A$ and $B$ with $n$ repeats. (1) We present an $O(n^2)$ time algorithm to solve the decision problem {\em SSR(A,B)}, i.e., determine whether a chromosome $A$ can be transformed into $B$ by a series of symmetric reversals. (2) We design an $O(n^2)$ time algorithm for a special 2-balanced case of {\em SMSR(A,B)}, where chromosomes $A$ and $B$ both have duplication number 2 and every repeat appears twice in different orientations in $A$ and $B$. (3) We show that SMSR is NP-hard even if the duplication number of the input chromosomes are at most 2, hence showing that the above positive optimization result is the best possible. As a by-product, we show that the \emph{minimum Steiner tree} problem on \emph{circle graphs} is NP-hard, settling the complexity status of a 38-year old open problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。