关于转置排序的某些变形的复杂性
On the Complexity of Some Variations of Sorting by Transpositions
摘要:
计算生物学的主要挑战之一是找到两个生物体之间的进化距离。在比较基因组学领域,估计这种距离的一种方法是找到将一个基因组转化为另一个基因组所需的重排(大规模突变)的最小成本序列,这被称为重排距离。在过去的几十年里,这些问题被研究考虑许多类型的重排(如反转,转位,transversals和revrevs),并考虑相同的权重为所有重排,或不同的权重取决于重排的类型。尽管最近给出了结合反转和换位的问题的困难证明,但涉及反转、换位和两种重排的问题的复杂性是已知的。在本文中,我们通过证明涉及反转,transversals和revrevs的换位模型是NP-困难的,考虑反转的权重w1和其他重排的权重w2,使得w2/w1小于或等于1.5,从而增强了对这些问题的认识。此外,我们解决了一个成本函数有关的重组所造成的碎片的数量,证明了问题的最小成本排序序列,考虑到碎片成本函数的一些限制,是NP难的换位和反转和换位的组合。
英文摘要:
One of the main challenges in Computational Biology is to find the evolutionary distance between two organisms. In the field of comparative genomics, one way to estimate such distance is to find a minimum cost sequence of rearrangements (large scale mutations) needed to transform one genome into another, which is called the rearrangement distance. In the past decades, these problems were studied considering many types of rearrangements (such as reversals, transpositions, transreversals, and revrevs) and considering the same weight for all rearrangements, or different weights depending on the types of rearrangements. The complexity of the problems involving reversals, transpositions, and both rearrangements is known, even though the hardness proof for the problem combining reversals and transpositions was recently given. In this paper, we enhance the knowledge for these problems by proving that models involving transpositions alongside reversals, transreversals, and revrevs are NP-hard, considering weights w1 for reversals and w2 for the other rearrangements such that w2/w1 is less than or equal to 1.5. In addition, we address a cost function related to the number of fragmentations caused by a rearrangement, proving that the problem of finding a minimum cost sorting sequence, considering the fragmentation cost function with some restrictions, is NP-hard for transpositions and the combination of reversals and transpositions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。