Sorting With Forbidden Intermediates - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Sorting With Forbidden Intermediates


A wide range of applications, most notably in comparative genomics, involve the computation of a shortest sorting sequence of operations for a given permutation, where the set of allowed operations is fixed beforehand. Such sequences are useful for instance when reconstructing potential scenarios of evolution between species, or when trying to assess their similarity. We revisit those problems by adding a new constraint on the sequences to be computed: they must avoid a given set of forbidden intermediates, which correspond to species that cannot exist because the mutations that would be involved in their creation are lethal. We initiate this study by focusing on the case where the only mutations that can occur are exchanges of any two elements in the permutations, and give a polynomial time algorithm for solving that problem when the permutation to sort is an involution.
Fichier principal
Vignette du fichier
1602.06283v1.pdf (415.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01287040 , version 1 (11-03-2016)



Carlo Comin, Anthony Labarre, Romeo Rizzi, Stéphane Vialette. Sorting With Forbidden Intermediates. Third International Conference on Algorithms for Computational Biology (AlCoB 2016), María Botón-Fernández; Carlos Martín-Vide; Miguel A. Vega-Rodríguez; Florentina Lilica Voicu, Jun 2016, Trujillo, Spain. ⟨hal-01287040⟩
124 View
112 Download



Gmail Facebook Twitter LinkedIn More