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

Baudet Christian, Dias Zanoni, Sagot, Sagot Marie-France

Description

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. Results 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. Conclusions 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.

Sujets

• Traces
• Sampling

Informations

• Publié par: biomed
• Publié le: 01 janvier 2012
• Nombre de lectures: 3
• Langue: English
• Poids de l'ouvrage: 2 Mo

Extrait

Baudet et al. Algorithms for Molecular Biology 2012, 7 :18 http://www.almob.org/content/7/1/18

R E S E A R C H Open Access Sampling solution traces for the problem of sorting permutations by signed reversals Christian Baudet 1,2* , Zanoni Dias 3 and Marie-France Sagot 1,2*

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. Results: 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. Conclusions: 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. Keywords: Reversals, Traces, Sampling, Genome rearrangement

Background the order and the orientation of the genomic markers of Permutations and reversals one species in relation to those of another. When studying genome rearrangements, we can identify  A subset of numbers ρ ⊆ { 1, . . . , n } is said to be an homologous markers with the integers 1, . . . , n , with a plus interval of a permutation π if there exist i , j ∈ { 1, . . . , n } , or minus sign to indicate on which strand they lie. By using  0 < i ≤ j ≤ n , such that ρ = {| π i | , . . . , | π j |} , where π x is this notation, we can represent by a signed permutation the element which is in position x of the permutation π . If we write the elements of different intervals in increas- s [e-mail] 1 * L C a o b rr o e ra p to o i n re de Bi n o ce m : e ´ c t h ri ri e st e i t an B . i b ol a o u g d i e e t E @ v u ol n u iv ti - v ly e, on U 1 n . i f v r; er m si a t ri e ´ e- d f e ra Lyon,Universit i u n si g n o g r l d e e x r ic ( o fo g r ra e p x h a i m c p o l r e d , e { r. 2,3,6,8 } ), we can compare them L 2 y I o N n RI 1 A , G C r N e R n S o , b U le M -R R5 h 5 ˆo 5 n 8 e- V A il l l p e e u s r , b t a e n a n m e, B F A ra M n B ce OO,655avenuedel’Europe,38334 Two intervals are said to overlap if they intersect but Montbonnot Cedex, France none is contained in the other. For example, if π = Full list of author information is available at the end of the article

© 2012 Baudet et al.; licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.