Resumen
A multi-cut rearrangement of a string S is a string ??'
S
'
obtained from S by an operation called k-cut rearrangement, that consists of (1) cutting S at a given number k of places in S, making S the concatenated string ??1·??2·??3·?·????·????+1
X
1
·
X
2
·
X
3
·
?
·
X
k
·
X
k
+
1
, where ??1
X
1
and ????+1
X
k
+
1
are possibly empty, and (2) rearranging the ????
X
i
s so as to obtain ??'=????(1)·????(2)·????(3)·?·????(??+1)
S
'
=
X
p
(
1
)
·
X
p
(
2
)
·
X
p
(
3
)
·
?
·
X
p
(
k
+
1
)
, ??
p
being a permutation on 1,2,?,??+1
1
,
2
,
?
,
k
+
1
satisfying ??(1)=1
p
(
1
)
=
1
and ??(??+1)=??+1
p
(
k
+
1
)
=
k
+
1
. Given two strings S and T built on the same multiset of characters from an alphabet S
S
, the Sorting by Multi-Cut Rearrangements (SMCR) problem asks whether a given number l of k-cut rearrangements suffices to transform S into T. The SMCR problem generalizes several classical genomic rearrangements problems, such as Sorting by Transpositions and Sorting by Block Interchanges. It may also model chromoanagenesis, a recently discovered phenomenon consisting of massive simultaneous rearrangements. In this paper, we study the SMCR problem from an algorithmic complexity viewpoint. More precisely, we investigate its classical and parameterized complexity, as well as its approximability, in the general case or when S and T are permutations.