关于有界块交换排序
On Sorting by Bounded Block Interchanges
摘要：
在这项工作中，我们考虑了一个限制性的情况下，以及研究排序块交换问题。我们对每一步要交换的块（子串）的长度设置一个上限k。我们称该问题为“k块交换排序”。当k=1时，我们证明了这个问题是NP难的。对于k=n-1，问题很容易，其中n是置换的长度（无界情况）。区组交换排序是比较基因组学中一个非常重要且被广泛研究的问题。
英文摘要：
In this work, we consider a restricted case of the well studied Sorting by Block Interchanges problem. We put an upper bound k on the length of the blocks (substrings) to be interchanged at each step. We call the problem Sorting by k-Block Interchanges. We show the problem to be NP-Hard for k=1. The problem is easy for k=n-1, where n is the length of the permutation (the unbounded case). Sorting by Block Interchanges is a very important and widely studied problem with applications in comparative genomics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
