Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Sorting With Forbidden Intermediates

Abstract : 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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Anthony Labarre Connect in order to contact the contributor
Submitted on : Friday, March 11, 2016 - 4:48:54 PM
Last modification on : Monday, March 21, 2022 - 5:22:04 PM
Long-term archiving on: : Monday, June 13, 2016 - 8:35:51 AM


Files produced by the author(s)


  • HAL Id : hal-01287040, version 1
  • ARXIV : 1602.06283


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⟩



Record views


Files downloads