A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions


Genome Rearrangements affect large stretches of genomes during evolution. One of the most studied genome rearrangement is the transposition, which occurs when a sequence of genes is moved to another position inside the genome. Mathematical models have been used to estimate the evolutionary distance between two different genomes based on genome rearrangements. However, many of these models have focused only on the (order of the) genes of a genome, disregarding other important elements in it. Recently, researchers have shown that considering existing regions between each pair of genes, called intergenic regions, can enhance the distance estimation in realistic data. In this work, we study the transposition distance between two genomes, but we also consider intergenic regions, a problem we name Sorting Permutations by Intergenic Transpositions (SbIT). We show that this problem is NP-hard and propose a 3.5-approximation algorithm for it.

Dates and versions

hal-02528304 , version 1 (01-04-2020)



Andre Rodrigues Oliveira, Géraldine Jean, Guillaume Fertin, Klairton Lima Brito, Ulisses Dias, et al.. A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions. 7th International Conference, AlCoB 2020 (Algorithms for Computational Biology ), Apr 2020, Missoula, United States. pp.16-28, ⟨10.1007/978-3-030-42266-0_2⟩. ⟨hal-02528304⟩
55 View
0 Download



Gmail Mastodon Facebook X LinkedIn More