Sorting by Transpositions is Difficult

Details Sorting by Transpositions is Difficult Sorting by Transpositions is Difficult

2010-11-04

arxiv.org/abs/1011.1157v1

Computer Science

Data Structures and Algorithms

Scientific paper

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?

Affiliated with

Also associated with

No associations

Rating

Sorting by Transpositions is Difficult does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sorting by Transpositions is Difficult, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sorting by Transpositions is Difficult will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-145974