Skip to Main content Skip to Navigation
Journal articles

Sampling solution traces for the problem of sorting permutations by signed reversals

Christian Baudet 1, 2, * Zanoni Dias 3 Marie-France Sagot 1, 4, * 
* Corresponding author
1 Baobab
PEGASE - Département PEGASE [LBBE]
4 BAMBOO - An algorithmic view on genomes, cells, and environments
Inria Grenoble - Rhône-Alpes, LBBE - Laboratoire de Biométrie et Biologie Evolutive - UMR 5558
Abstract : Background
Traditional algorithms to solve the problem of sorting by signed reversals output just one optimal solution while the space of all optimal solutions can be huge. A so-called trace represents a group of solutions which share the same set of reversals that must be applied to sort the original permutation following a partial ordering. By using traces, we therefore can represent the set of optimal solutions in a more compact way. Algorithms for enumerating the complete set of traces of solutions were developed. However, due to their exponential complexity, their practical use is limited to small permutations. A partial enumeration of traces is a sampling of the complete set of traces and can be an alternative for the study of distinct evolutionary scenarios of big permutations. Ideally, the sampling should be done uniformly from the space of all optimal solutions. This is however conjectured to be ♯P-complete.
We propose and evaluate three algorithms for producing a sampling of the complete set of traces that instead can be shown in practice to preserve some of the characteristics of the space of all solutions. The first algorithm (RA) performs the construction of traces through a random selection of reversals on the list of optimal 1-sequences. The second algorithm (DFALT) consists in a slight modification of an algorithm that performs the complete enumeration of traces. Finally, the third algorithm (SWA) is based on a sliding window strategy to improve the enumeration of traces. All proposed algorithms were able to enumerate traces for permutations with up to 200 elements.
We analysed the distribution of the enumerated traces with respect to their height and average reversal length. Various works indicate that the reversal length can be an important aspect in genome rearrangements. The algorithms RA and SWA show a tendency to lose traces with high average reversal length. Such traces are however rare, and qualitatively our results show that, for testable-sized permutations, the algorithms DFALT and SWA produce distributions which approximate the reversal length distributions observed with a complete enumeration of the set of traces.
Document type :
Journal articles
Complete list of metadata

Cited literature [28 references]  Display  Hide  Download
Contributor : Ed. BMC Connect in order to contact the contributor
Submitted on : Monday, February 4, 2013 - 12:59:15 PM
Last modification on : Saturday, August 6, 2022 - 3:46:21 AM
Long-term archiving on: : Monday, June 17, 2013 - 6:37:09 PM


Publisher files allowed on an open archive



Christian Baudet, Zanoni Dias, Marie-France Sagot. Sampling solution traces for the problem of sorting permutations by signed reversals. Algorithms for Molecular Biology, BioMed Central, 2012, 7 (1), pp.18. ⟨10.1186/1748-7188-7-18⟩. ⟨hal-00784400⟩



Record views


Files downloads