Approximation algorithms for sorting by length-weighted prefix and suffix operations

Abstract : The traditional approach for the problems of sorting permutations by rearrangements is to consider that all operations have the same unitary cost. In this case, the goal is to find the minimum number of allowed rearrangements that are needed to sort a given permutation, and numerous efforts have been made over the past years regarding these problems. On the other hand, a long rearrangement (which is in fact a mutation) is more likely to disturb the organism. Therefore, weights based on the length of the segment involved may have an important role in the evolutionary process. In this paper we present the first results regarding problems of sorting permutations by length-weighted operations that consider rearrangement models with prefix and suffix variations of reversals and transpositions, which are the two most common types of genome rearrangements. Our main results are O(lg2⁡n)O(lg2⁡n)-approximation algorithms for 10 such problems.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2015, 593, pp.26-41. 〈10.1016/j.tcs.2015.05.039〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01164599
Contributeur : Guillaume Fertin <>
Soumis le : mercredi 17 juin 2015 - 12:43:55
Dernière modification le : jeudi 17 mai 2018 - 12:52:03

Identifiants

Collections

Citation

Carla Negri Lintzmayer, Zanoni Dias, Guillaume Fertin. Approximation algorithms for sorting by length-weighted prefix and suffix operations. Theoretical Computer Science, Elsevier, 2015, 593, pp.26-41. 〈10.1016/j.tcs.2015.05.039〉. 〈hal-01164599〉

Partager

Métriques

Consultations de la notice

82