Answers are grounded in this paper and cite their sources.
In comparative genomics, a transposition is an operation that exchanges two consecutive sequences of genes in a genome. The transposition distance between two genomes, 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 is called the Sorting by Transpositions problem, and has been introduced by Bafna and Pevzner in [Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 614--623]. It has naturally been the focus of a number of studies (see, for instance, [G. Fertin, A. Labarre, I. Rusu, É. Tannier, and S. Vialette, Combinatorics of Genome Rearrangements, The MIT Press, Cambridge, MA, 2009]), 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, first described in [D. A. Christie, Genome Rearrangement Problems, Ph.D. thesis, University of Glasgow, Glasgow, Scotland, 1998], is NP-hard: given a permutation π, is it possible to sort π using exactly db(π)/3 transpositions, where db(π) is the number of breakpoints of π?
No takes yet. Share an insight, caveat, or question.
Bulteau et al. (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: