Sorting by Transpositions is Difficult

In comparative genomics, a transposition is an operation that exchanges two consecutive sequences of genes in a genome. The transposition distance, that is, the minimum number of transpositions needed to transform a genome into another, is, according to numerous studies, a relevant evolutionary distance. The problem of computing this distance when genomes are represented by permutations, called the Sorting by Transpositions problem, has been introduced by Bafna and Pevzner in 1995. It has naturally been the focus of a number of studies, but the computational complexity of this problem has remained undetermined for 15 years. In this paper, we answer this long-standing open question by proving that the Sorting by Transpositions problem is NP-hard. As a corollary of our result, we also prove that the following problem is NP-hard: given a permutation pi, is it possible to sort pi using db(pi)/3 permutations, where db(pi) is the number of breakpoints of pi?

💡 Research Summary

The paper addresses a long‑standing open problem in comparative genomics: determining the computational complexity of the “Sorting by Transpositions” problem. A transposition swaps two consecutive blocks of genes in a genome, and the transposition distance—the minimum number of such operations needed to transform one genome into another—has been proposed as a biologically meaningful evolutionary metric. Since its introduction by Bafna and Pevzner in 1995, researchers have developed upper and lower bounds, exact algorithms for restricted cases, and approximation algorithms (most notably a 1.5‑approximation), yet the exact complexity of computing the optimal distance remained unknown for more than a decade.

The authors settle this question by proving that Sorting by Transpositions is NP‑hard. Their proof proceeds via a polynomial‑time reduction from the canonical NP‑complete problem 3‑SAT. The reduction is carefully constructed: each Boolean variable and each clause of a 3‑SAT instance is encoded as a specific block of a permutation. The permutation is designed so that a single transposition corresponds to assigning a truth value to a variable, and the effect of a transposition on the permutation’s breakpoint graph mirrors the logical satisfaction of the clause. Central to the construction is the notion of a breakpoint (db(π)), the number of adjacent pairs that are out of order. The authors observe that a transposition can reduce the breakpoint count by at most three, which allows them to formulate a decision version of the problem: “Given a permutation π, can it be sorted using at most db(π)/3 transpositions?” They prove that this decision problem is equivalent to the original optimization problem and that it is NP‑hard via the reduction.

The reduction consists of two stages. First, a 3‑SAT instance is transformed into a permutation with a controlled number of breakpoints, preserving satisfiability: a satisfiable formula yields a permutation that can be sorted with a specific number of transpositions, while an unsatisfiable formula forces any sorting sequence to exceed that bound. Second, the authors show that any algorithm solving Sorting by Transpositions would also solve the breakpoint‑bounded decision problem, establishing NP‑hardness. Throughout, the construction maintains polynomial size, and each transposition in the target permutation corresponds to a logical operation in the original formula, ensuring correctness of the reduction.

Beyond the primary result, the paper derives a corollary: the breakpoint‑bounded decision problem itself—determining whether a permutation can be sorted with at most db(π)/3 transpositions—is NP‑hard. This highlights a deep connection between the combinatorial structure of permutations (breakpoints and cycles) and the logical structure of Boolean formulas.

In the discussion, the authors note that while they have shown NP‑hardness, membership in NP remains open because verifying a given sequence of transpositions is straightforward, but proving that no shorter sequence exists may require non‑deterministic verification beyond current techniques. They also compare their hardness result with existing approximation algorithms, suggesting that the 1.5‑approximation may be close to the best possible under standard complexity assumptions. The paper points to several avenues for future work: exploring fixed‑parameter tractability with respect to parameters such as the number of breakpoints, designing improved approximation schemes, and extending the hardness framework to related genome rearrangement operations (e.g., reversals, block‑interchanges). Additionally, the authors propose investigating special classes of permutations—those with bounded breakpoint count or particular cycle structures—where exact polynomial‑time algorithms might still be feasible.

Overall, the work resolves a fifteen‑year‑old question by establishing the NP‑hardness of Sorting by Transpositions, thereby delineating the theoretical limits of exact computation of transposition distance. This result has significant implications for computational biology, where transposition distance is used as a proxy for evolutionary divergence, and for algorithmic research, where it motivates the development of robust approximation and parameterized algorithms for genome rearrangement problems.