Sorting by weighted inversions considering length and symmetry - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue BMC Bioinformatics Année : 2015

Sorting by weighted inversions considering length and symmetry

Résumé

Large-scale mutational events that occur when stretches of DNA sequence move throughout genomes are called genome rearrangements. In bacteria, inversions are one of the most frequently observed rearrangements. In some bacterial families, inversions are biased in favor of symmetry as shown by recent research. In addition, several results suggest that short segment inversions are more frequent in the evolution of microbial genomes. Despite the fact that symmetry and length of the reversed segments seem very important, they have not been considered together in any problem in the genome rearrangement field. Here, we define the problem of sorting genomes (or permutations) using inversions whose costs are assigned based on their lengths and asymmetries. We consider two formulations of the same problem depending on whether we know the orientation of the genes. Several procedures are presented and we assess these procedure performances on a large set of more than 4.4 × 10^9 permutations. The ideas presented in this paper provide insights to solve the problem and set the stage for a proper theoretical analysis.
Fichier principal
Vignette du fichier
art_10.1186_1471-2105-16-S19-S3.pdf (2.4 Mo) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01316998 , version 1 (17-05-2016)

Identifiants

Citer

Christian Baudet, Ulisses Dias, Zanoni Dias. Sorting by weighted inversions considering length and symmetry. BMC Bioinformatics, 2015, 16 (Suppl 19), pp.11. ⟨10.1186/1471-2105-16-S19-S3⟩. ⟨hal-01316998⟩
68 Consultations
117 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More