Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On Sorting by Bounded Block Interchanges   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.

2
The categories of this paper are: math
10
The categories of this paper are: q-bio
27
The categories of this paper are: comp-gas
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci
0
The categories of this paper are: hep-ph
19
The categories of this paper are: eess
24
The categories of this paper are: dg-ga
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
9
The categories of this paper are: nlin
35
The categories of this paper are: mtrl-th
34
The categories of this paper are: chem-ph
17
The categories of this paper are: q-fin
30
The categories of this paper are: q-alg
33
The categories of this paper are: plasm-ph