Sorting by Transpositions is Difficult - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Sorting by Transpositions is Difficult

Résumé

In comparative genomics, a transposition is an operation that ex- changes 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, can be considered as a relevant evolutionary distance. The problem of computing this distance when genomes are represented by permuta- tions, called the S ORTING BY T RANSPOSITIONS problem (SBT), has been in- troduced by Bafna and Pevzner [3] in 1995. It has naturally been the focus of a number of studies, but the computational complexity of this problem has re- mained undetermined for 15 years. In this paper, we answer this long-standing open question by proving that the S ORTING BY T RANSPOSITIONS problem is NP-hard. As a corollary of our re- sult, we also prove that the following problem from [9] is NP-hard: given a per- mutation π, is it possible to sort π using db (π)/3 permutations, where db (π) is the number of breakpoints of π?
Fichier principal
Vignette du fichier
Transpositions-ICALP11.pdf (271.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00606223 , version 1 (05-07-2011)

Identifiants

  • HAL Id : hal-00606223 , version 1

Citer

Laurent Bulteau, Guillaume Fertin, Irena Rusu. Sorting by Transpositions is Difficult. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), 2011, Zürich, Switzerland. pp.654-665. ⟨hal-00606223⟩
145 Consultations
110 Téléchargements

Partager

Gmail Facebook X LinkedIn More