An asymmetric approach to preserve common intervals while sorting by reversals
 Marília DV Braga^{1, 2, 3}Email author,
Affiliated with
 Christian Gautier^{1, 2} and
Affiliated with
 MarieFrance Sagot^{1, 2}
Affiliated with
DOI: 10.1186/17487188416
© Braga et al. 2009
Received: 6 March 2009
Accepted: 30 December 2009
Published: 30 December 2009
Abstract
Background
The reversal distance and optimal sequences of reversals to transform a genome into another are useful tools to analyse evolutionary scenarios. However, the number of sequences is huge and some additional criteria should be used to obtain a more accurate analysis. One strategy is searching for sequences that respect constraints, such as the common intervals (clusters of colocalised genes). Another approach is to explore the whole space of sorting sequences, eventually grouping them into classes of equivalence. Recently both strategies started to be put together, to restrain the space to the sequences that respect constraints. In particular an algorithm has been proposed to list classes whose sorting sequences do not break the common intervals detected between the two inital genomes A and B. This approach may reduce the space of sequences and is symmetric (the result of the analysis sorting A into B can be obtained from the analysis sorting B into A).
Results
We propose an alternative approach to restrain the space of sorting sequences, using progressive instead of initial detection of common intervals (the list of common intervals is updated after applying each reversal). This may reduce the space of sequences even more, but is shown to be asymmetric.
Conclusions
We suggest that our method may be more realistic when the relation ancestordescendant between the analysed genomes is clear and we apply it to do a better characterisation of the evolutionary scenario of the bacterium Rickettsia felis with respect to one of its ancestors.
Background
Genomes are not static but are instead subject to continuous mutations during evolution. These mutations can be of different types and scales. Events such as single nucleotide polymorphisms (SNPs), that affect only one nucleotide at a time, are said to be small scale events, and are more frequent than large scale events [1]. The main known rearrangements or large scale events are reversals of large portions of chromosomes, insertions of new genes (usually due to duplications or horizontal transfer between species), deletions or loss of genes, transpositions of DNA fragments within a chromosome, fusions and/or fissions of chromosomes, translocations of DNA fragments between chromosomes.
Reversals are among the rearrangement events more frequently observed, specially (but not exclusively) in the evolution of prokaryotes. Most of the existing differences between six species of the Rickettsia bacterium thus appear to be explained by reversals [2]. Computing the reversal distance, that is, the minimum number of reversals required to transform a genome into another, and finding one optimal sequence of reversals that transforms one genome into the other are useful tools to analyse real evolutionary scenarios. When duplications are not allowed, both problems can be solved in polynomial time [3–5]. These two problems have been the topic of several works [5–8] and can be solved with the aid of some currently available softwares. One is the package GRAPPA[9] (Genome Rearrangements Analysis under Parsimony and other Phylogenetic Algorithms), that contains several programs to deal with genome rearrangements and can be downloaded at http://www.cs.unm.edu/~moret/GRAPPA/. Another is the software GRIMM[10], that contains also algorithms for multichromosomal genome rearrangements and is available online at http://grimm.ucsd.edu/GRIMM/. These programs were used in particular by Blanc et al. [2] in the analysis of the Rickettsia bacteria.
Other approaches are also able to find one optimal sorting sequence, but this is often insufficient to allow a proper analysis, since there are many different sequences, and taking one is not enough to evaluate the evolutionary scenario in a realistic way. In order to select a more meaningful sequence, a good strategy is to consider some biological constraints. A promising constraint to this purpose is the list of clusters of colocalised genes, which are common intervals of the genomes composed by the same genes but not necessarily in the same order and orientations [11]. A sorting sequence of reversals that does not cut any common interval detected between the two initial genomes A and B may be more accurate than a sorting sequence that does not have this property. In addition, this approach is symmetric, that is, the result of the analysis of the sequences that sort A into B can be directly obtained from the result of the analysis of the sequences that sort B into A. Several studies take common intervals in consideration when sorting by reversals [11–14].
Exploring the whole set of sequences is also an interesting strategy to analyse the evolution of the considered organisms. The first step in this direction was an algorithm that allows the enumeration of all sequences of reversals sorting one genome into another, proposed by Siepel [15]. However, since the number of sequences is usually huge, the whole set is very hard to handle and this could be as useless as finding one sequence. Bergeron et al. [16] then proposed a model to represent the sequences in a compact way, grouping them into classes of equivalence. This method allows to reduce substantially the number of elements to be handled, and an algorithm to directly enumerate all the classes was given by Braga et al. [17].
Braga et al. started to put both strategies together, that is, to construct only the classes whose sequences respect some biological constraints. The authors showed that it is possible to reduce the number of classes by selecting only those composed by sequences whose reversals do not cut any common interval initially detected [17]. In the present work, we propose a variation of this approach which, instead of initial detection, uses a progressive detection of common intervals to explore the solution space of sorting by reversals (the common intervals are recomputed after applying each reversal). We observe that this new approach is asymmetric, but relevant when the relation ancestordescendant between the studied genomes is clear. We show that it can reduce considerably the universe of solutions. We also revise a result proposed by Braga et al. [17], when the perfect constraint is relaxed to accept some common interval breaks. The consequences of introducing this relaxation have not been deeply discussed by Braga et al., and we show that this strategy also leads to asymmetric sequences of reversals.
We applied our adapted algorithm to characterise the space of all solutions between the bacterium Rickettsia felis and one of its ancestors, taking into account the progressively detected common intervals. Observe that we assume that the philogeny of the studied species is known, thus in this first approach our method is not used to reconstruct philogeny. However, the assymmetry of our method could be used to infer philogeny in a next step. Approaches using the reversal distance to infer philogeny exist, such as the median problem with reversals [18] and other problems of rearrangements in multiple genomes [19]. Note that these approaches consider at least three genomes and generally consist of heuristics and approximation algorithms (the reversal median problem is proven to be NPhard [20]).
Methods
Permutations, intervals and reversals
We represent the studied genomes by the list of homologous markers (usually genes or blocks of contiguous genes) between them. These markers are represented by the integers 1, 2,..., n, with a plus or minus sign to indicate the strand they lie on. The order and orientation of the markers of one genome in relation to the other is given by a signed permutation π = (π _{1}, π _{2},..., π _{ n1}, π _{ n }) of size n over {n,..., 1, 1,..., n}, such that, for each value i from 1 to n, either i or i is mandatorily present, but not both. The identity permutation (1, 2, 3,..., n) is denoted by ℐ_{ n }.
A subset of numbers ρ ⊆ {1, 2,..., n  1, n} is said to be an interval of a permutation π if there exist i, j ∈ {1,..., n}, 1 ≤ i ≤ j ≤ n, such that ρ = {π _{ i },π _{ i+1},..., π _{ j1},π _{ j }}. Given a permutation π and an interval ρ of π, we can apply a reversal on the interval ρ of π, that is, the operation which reverses the order and flips the signs of the elements of ρ, denoted by π ∘ ρ. If
For example, with the permutation π = (3, 2, 1, 4) and the interval ρ = {1, 2, 4} we have π ∘ ρ = (3, 4, 1, 2). Due to this, an interval ρ can also be used to denote a reversal. An isequence of reversals ρ _{1} ρ _{2}...ρ _{ i } is valid for a permutation π if ρ _{1} is an interval of π, ρ _{2} is an interval of π ∘ ρ _{1}, ρ _{3} is an interval of (π ∘ ρ _{1}) ∘ ρ _{2}, and so on. If ρ _{1} ρ _{2}...ρ _{ i } is a valid isequence of reversals for a permutation π, then π ∘ ρ _{1} ρ _{2}...ρ _{ i } denotes the consecutive application of the reversals ρ _{1}, ρ _{2},...ρ _{ i } in the order in which they appear. We say that an isequence of reversals ρ _{1}...ρ _{ i } sorts a permutation π into a permutation π _{ T } if π ∘ ρ _{1}...ρ _{ i } = π _{ T }.
The length of a shortest sequence of reversals sorting a permutation π into π _{ T } is called the reversal distance of π and π _{ T }, and is denoted by d(π, π _{ T }). Let s = ρ _{1} ρ _{2}...ρ _{ i } be a valid isequence of reversals for a permutation π. If d(π ∘ s, π _{ T }) = d(π, π _{ T })  i, then s is said to be an optimal isequence. Moreover, if s is an optimal isequence and i = d(π, π _{ T }), then s is simply called an optimal sorting sequence for π and π _{ T }. We also define the kprefix of an optimal sorting sequence s as the sequence composed by the first k reversals of s. Observe that if s' is a kprefix of an optimal sequence s sorting p into π _{ T }, then d(π ∘ s', π _{ T }) = d(π, π _{ T })  k, that is, s' is an optimal ksequence for π and π _{ T }. For example, if we consider two permutations π = (3, 2, 1, 4) and π _{ T } = ℐ_{4}, we have d(π, π _{ T }) = 4 and one optimal sorting sequence is {1, 2, 4}{1, 3, 4}{2, 3, 4}{3}, whose 1, 2 and 3prefixes are {1, 2, 4}, {1, 2, 4}{1, 3, 4} and {1, 2, 4}{1, 3, 4}{2, 3, 4}.
For any sequence of reversals s = ρ _{1} ρ _{2}...ρ _{ d1} ρ _{ d } sorting a permutation π into a permutation π _{ T }, we define the inverse of s as inv(s) = ρ _{ d } ρ _{ d1}...ρ _{2} ρ _{1}. Observe that the sequence inv(s) sorts π _{ T } into π, and, consequently, each optimal sequence sorting π into π _{ T } has an equivalent optimal sequence sorting π _{ T } into π. Due to this, the approach of sorting one genome into another by reversals is said to be symmetric.
Henceforth we will generally use simply the term sequence or isequence to refer to an optimal sequence or optimal isequence of reversals. Without loss of generality, we often omit the target permutation π _{ T }. In this case, π _{ T } corresponds to the identity permutation ℐ_{ n } = (1, 2, 3,..., n), where n is the size of the initial permutation π, and the notation d(π) is equivalent to d(π, ℐ_{ n }).
Sequences of reversals and common intervals
Clusters of colocalised genes are intervals of the genomes composed by the same genes but not necessarily in the same order and orientations. These clusters are modeled as common intervals between two permutations π and π _{ T }, which are the intervals of π that are present in π _{ T }, but not necessarily with the same internal order and orientations. For example, the interval {1, 2, 3} is common to the permutations π = (3, 2, 1, 4) and ℐ_{4} = (1, 2, 3, 4). We say that all intervals with size equal to 1 and the interval with size n, that comprises the entire permutation, are trivial common intervals.
Two intervals are said to overlap if they intersect but none is contained in the other. For example, in the permutation (3, 2, 1, 4), the intervals {2, 3} and {1, 2, 4} overlap, while {2, 3} and {1, 2, 3} do not. A reversal ρ breaks an interval θ if ρ and θ overlap. Thus, the reversal {1, 2, 4} breaks the interval {2, 3}, while the reversal {1, 2, 3} does not. Observe that a reversal never breaks a trivial common interval. The concept of irreducible common intervals has been introduced by Heber and Stoye [21]. The authors showed that any common interval θ between two permutations π and π _{ T } has a generating chain of intervals (γ _{1}, γ _{2},..., γ _{ k }), such that the intervals γ _{1}, γ _{2},..., γ _{ k } are listed in lexicographic order, and, for each pair of consecutive intervals γ _{ j }, γ _{ j+1}, we have γ _{ j } ∩ γ _{ j+1}≠ ∅. A reducible common interval is an interval whose generating chain has length at least two, otherwise the common interval is irreducible. For example, the generating chain of the reducible common interval {1, 2, 3} between the permutations (3, 2, 1, 4) and ℐ_{4} is ({1, 2}, {2, 3}) (the intervals {1, 2} and {2, 3} are irreducible). Testing whether a reversal breaks an irreducible common interval is sufficient to determine whether it breaks a common interval.
Proposition 1 A reversal ρ breaks a reducible interval θ, if, and only if, breaks at least one irreducible interval in the chain that generates θ.
Proof. It is easy to see that breaking an irreducible interval in the chain that generates a reducible interval θ also breaks θ. Since each pair of consecutive irreducible intervals in the chain that generates θ have a nonempty intersection, breaking θ breaks at least one irreducible interval in the chain that generates θ. □
As a consequence of Proposition 1, if ρ does not break any irreducible interval between two permutations π and π _{ T }, then ρ does not break any reducible interval between π and π _{ T } as well. While the number of common intervals is bounded by n ^{2}, the number of irreducible common intervals is bounded by n [21], where n is the size of the input permutations.
In this approach, however, the new common intervals that could appear between an intermediary permutation, after applying some reversals to the initial permutation, and the target permutation, are not considered. Thus, if a common interval appears between an intermediary permutation and the target permutation, there is no constraint on the selection of a reversal that breaks this new interval (see Figure 1(B)). Alternatively to the initial detection, in this work we propose the progressive detection of common intervals, that consists in updating the list of (irreducible) common intervals between the permutations after each reversal. An optimal sorting sequence that does not break the progressively detected irreducible common intervals is called progressive perfect sorting sequence. Figure 1(C) shows an example of this approach.
Differently from the perfect sorting sequences, the progressive perfect sorting sequences are asymmetric, that is, inverting a progressive perfect sorting sequence that sorts a first into a second permutation generally does not result in a progressive perfect sorting sequence that sorts the second permutation into the first. An example is given in Figure 1(C). Observe that, applying the last reversal {4, 5, 6} on the permutation (1, 2, 3, 4, 5, 6, 7, 8) results in the permutation (1, 2, 3, 6, 5, 4, 7, 8), that has the common interval {4, 7, 8} with respect to the permutation (5, 2, 7, 4, 8, 3, 6, 1). The reversal {3,..., 7} (the third from bottom to top in Figure 1(C)) overlaps with {4, 7, 8}, thus inverting the progressive perfect sequence of reversals {2, 4, 7}, {4, 5, 7}, {6}, {2, 3, 6, 8}, {1,..., 8}, {3,..., 7}, {3,..., 8}, {4, 5, 6} that sorts (5, 2, 7, 4, 8, 3, 6, 1) into (1, 2, 3, 4, 5, 6, 7, 8) does not result in a progressive perfect sequence of reversals that sorts (1, 2, 3, 4, 5, 6, 7, 8) into (5, 2, 7, 4, 8, 3, 6, 1).
When we compare current species, it is not possible to determine a direction to the analysis. In this case, considering common intervals that appear in intermediary states is meaningless and a symmetric approach is more adequate. Symmetry is thus an advantage that supports the initial detection of common intervals in many applications. We suggest however that, when the relation ancestordescendant between the analysed genomes is clear, the progressive detection of common intervals may be more realistic than the initial detection of common intervals. In this case, the analysis should be done from the descendant to the ancestor, since the objective is to regroup intervals that may have existed in a past time.
Common intervals in the analysis of the space of optimal sorting sequences
Finding one optimal sequence of reversals that sorts a permutation into another is only one part of the information required to analyse an evolutionary scenario, even when we get a sequence that does not break the common intervals. The number of sorting sequences is indeed usually huge and having a complete representation of the space of solutions is desirable in order to obtain a more realistic study. Bergeron et al. [16] proposed a model to represent the universe of solutions in a compact way, grouping solutions into classes of equivalence, also called traces.
Two sequences of reversals are considered equivalent, and, consequently, are in the same trace, if one can be obtained from the other by a sequence of commutations of nonoverlapping reversals (the operation of commutation can be applied to two reversals ρ and θ which appear consecutively in a sequence of reversals and consists in replacing the sequence ρθ by θρ). A trace is represented by its normal form [16, 17], which corresponds to one of its sorting sequences that can be decomposed into substrings s = u _{1} < ⋯ <u _{ m }, such that:

every pair of reversals of a substring u _{ i }is nonoverlapping;

for every reversal ρ of a substring u _{ i }(i > 1), there is at least one reversal θ of the substring u _{ i1} such that ρ and θ overlap;

every substring u _{ i }is increasing according to the lexicographic order.
Observe that in the original notation the normal form of a trace is s = u _{1}...u _{ m } [16], but we prefer to use the symbol '<' instead of '' as it gives a clearer indication of the order that applies between the substrings.
This method allows to reduce substantially the number of elements to be handled with respect to the whole set of solutions. The 28 sequences that sort the permutation (3, 2, 1, 4), for instance, can be grouped in only two traces, one is {1}{1, 2, 3}{2}{4} (that contains 24 sequences), and the other is {1, 2, 4}{3} < {1, 3, 4} < {2, 3, 4} (that contains 4 sequences).
Constructing traces
An algorithm to directly enumerate all the traces, computing the number of sequences in each trace, was given by Braga et al. [17], and consists in an incremental construction. At each iteration i the algorithm constructs the so called itraces for the given permutations π and π _{ T }, that are the traces that contain all the optimal isequences for sorting π into π _{ T }. The itraces are constructed from the previous (i  1)traces with the following procedure. For each previous (i  1)trace T, whose normal form is f, the algorithm obtains an intermediary permutation π _{ f } = π ∘ f. Then it calculates all the next optimal 1sequences for π _{ f } with the help of an algorithm proposed by Siepel [15] and constructs the next itraces by adding each one of the returned 1sequences to the previous (i  1)trace T. Initially, all the itraces obtained from the (i  1)trace T have the same number of sorting sequences than T. Then the algorithm verifies whether, for each one of the new itraces, there is an equivalent itrace that is present in the list of already constructed itraces. If this is the case, only one of the two equivalent itraces is kept in the list, but the number of sequences in it is the sum of the sequences in the two equivalent itraces. At the end, we have the final list of dtraces, where d is the reversal distance of (π, π _{ T }), and the number of sorting sequences in each dtrace.
Constructing perfect traces
Traces have been analysed with respect to common intervals, and the following proposition has been proven by Braga et al. [17]:
Proposition 1. Every trace of optimal solutions for sorting a signed permutation by reversals contains either only perfect solutions or no perfect solution (Braga et al. [17]).
Due to this property, a trace that contains perfect sorting sequences is called a perfect trace. Because the perfect sorting sequences are symmetric, the perfect traces are also symmetric (if T is a perfect trace sorting π into π _{ T }, then inv(T) = { inv(s)  s ∈ T} is a perfect trace sorting π _{ T } into π).
To compute the perfect traces, we need to introduce a few modifications to the original algorithm. We should first compute the initial irreducible common intervals between the two given permutations. Then, each time we compute the 1sequences with Siepel's algorithm, we need to verify whether each one of the resulting 1sequences breaks or not an irreducible common interval initially detected (the 1sequences that break irreducible common intervals are simply discarded). At the end, we have only the perfect traces, if at least one perfect trace exists (otherwise we have an empty result).
Constructing progressive perfect subtraces
In this work, we propose to analyse the space of all sorting sequences with respect to the progressive detection of common intervals. First we observe that, if we consider the progressive detection of common intervals, Proposition 1 does not hold anymore. Considering the permutation (5, 2, 7, 4, 8, 3, 6, 1), for instance, the sequences of reversals {2,..., 5, 7, 8}, {3, 8}, {3, 4, 7}, {1,..., 8}, {2}, {4}, {2, 3, 4}, {2,..., 6} and {3, 8}, {3, 4, 7}, {2,..., 5, 7, 8}, {1,..., 8}, {2}, {4}, {2, 3, 4}, {2,..., 6} are in the same trace but, while the first preserves the progressively detected common intervals (as we can see in Figure 1(C)), the second does not (after applying the two first reversals, {3, 8} and {3, 4, 7}, we have the permutation (5, 2, 3, 4, 7, 8, 6) with the common interval {6, 7, 8} which overlaps with the third reversal, {2,..., 5, 7, 8}). Thus, when we take the progressively detected common intervals in consideration, for each trace, only a subset of its sorting sequences is selected. We call this subset a progressive perfect subtrace. Consider a progressive perfect subtrace t of optimal sequences sorting a permutation π. Frequently the normal form of the trace T that contains t is not part of t. Due to this, when constructing progressive perfect subtraces, we also give at least one valid representative of each progressive perfect subtrace t, besides the normal form of the trace T that contains t. A progressive perfect subtrace t can be thus represented by a 2tuple (e, f), where e is any sorting sequence in t and f is the normal form of the trace T that contains t. The normal form of the sorting sequence described in Figure 1(C) is f = {1,..., 8}{2, 4, 7}{6} < {2, 3, 6, 8}{4, 5, 7} < {3,..., 7}{3,..., 8}{4, 5, 6}, which is not a progressive perfect sequence and cannot be taken as a valid representative. However, the progressive perfect subtrace that contains the sorting sequence described in Figure 1(C) can be represented by the 2tuple (e, f), where the valid progressive perfect representative e is {2, 4, 7}, {4, 5, 7}, {6}, {2, 3, 6, 8}, {1,..., 8}, {3,..., 7}, {3,..., 8}, {4, 5, 6}.
In addition, since the progressive perfect sorting sequences are asymmetric, the progressive perfect subtraces are also asymmetric, that is, the inverse of the progressive perfect sequences in a subtrace sorting a first permutation into a second are not necessarily progressive perfect sequences sorting the second permutation into the first.
To construct the progressive perfect subtraces, we need to modify the original algorithm of Braga et al. [17]. Analogously to the notation given by Braga et al., a progressive perfect subtrace whose sorting sequences have i reversals is called progressive perfect isubtrace, and a progressive perfect ksubtrace t' is a kprefix of a progressive perfect isubtrace t (k ≤ i) if each ksequence of t' is a prefix of an isequence of t. To compute the progressive perfect subtraces, as in the original algorithm developed by Braga et al. [17], at each step we use the algorithm of Siepel [15] to list all possible 1sequences. Then we filter these 1sequences to discard those that break irreducible common intervals progressively detected. As a result of this procedure (see Algorithm 1), we construct directly the progressive perfect subtraces.
Algorithm 1: Enumerating all the progressive perfect subtraces of two signed permutations
Input: Two signed permutations π and π _{ T }
Output: The representative, normal form and counter (e, f, c) of each progressive perfect subtrace of sequences sorting π into π _{ T }
d ← reversal distance of (π, π _{ T })
← ∅
I _{0} ← {θ  θ is an irred. comm. int. of π and π _{ T } }
S _{0} ← {ρ  ρ is an opt. 1seq. for π → π _{ T } } [Siepel [15]
for each 1seq. ρ ∈ S _{0} do
if ρ does not break an int. in I _{0} [filter] then
insert (ρ, ρ, 1) in [each perf. first 1seq. is a prog. perf. 1subtr.]
end if
end for
for each integer i from 2 to d do
← ∅ [to keep all prog. perf. isubtr.]
for each (e, f, c) in [(e, f) is a prog. p. (i  1)subtr.; c is the counter] do
π _{ f } ← π ∘ f [apply the (i  1)seq. f to π ]
I _{ f } ← {θ  θ is an irred. comm. int. of π _{ f } and π _{ T } }
S _{ f } ← { ρ  ρ is an opt. 1seq. for π _{ f } → π _{ T } } [Siepel [15]
for each 1seq. ρ∈ S _{ f } do
if ρ does not break an int. in I _{ f } [filter] then
f _{ ρ }← f + ρ [add ρ to extend f; see Braga et al. [17]
if there exists (e', f', c') ∈ such that f' = f _{ ρ } [CMP] then
c' ← c' + c [update the counter
of the prog. perf. isubtr. (e', f')]
else
e _{ ρ }← e · ρ [concat. ρ to the seq. e]
insert (e _{ ρ } , f _{ ρ } , c) in [(e _{ ρ } , f _{ ρ }) is a
prog. perf. isubtr.; c is the counter]
end if
end if
end for
end for
←
end for
return [ is the final set of progressive perfect dsubtraces sorting π into π _{ T }]
As in the original algorithm, we may need to compare subtraces to verify whether a new subtrace t is present in the list of already constructed subtraces (Algorithm 1, step CMP). In order to do that, we use the normal form f of the trace T that contains t, and compare f to the normal forms of the traces that contain the already constructed subtraces. The normal form of an itrace is constructed incrementally, from the normal form of one of its (i  1)prefixes [17]. The representative of an isubtrace is also constructed incrementally, by concatenating a reversal to the end of the sequence that represents one of its (i  1)prefixes. Thus, for two given permutations π and π _{ T }, at the end of Algorithm 1, we have the list of all nonempty progressive perfect subtraces and each progressive perfect subtrace t is represented by a 2tuple (e, f), where e is any progressive perfect sorting sequence in t and f is the normal form of the trace T that contains t. If no progressive perfect sequence exists for sorting π into π _{ T }, we have an empty result.
Results and discussion
Theoretical complexity and experimental results
The original algorithm of Braga et al. [17] has complexity O( ), where n is the size of the input permutation π, N is the number of computed final traces and k _{ max } is the maximum value for the width of a final trace [17]. The 4 in the exponent of this formula is due to the processing of each (i  1)trace T to generate the subsequent itraces, given by the following procedure: (1) apply the sequences of reversals of f, which is the normal form of T, on the initial permutation π to obtain π _{ f } ; (2) run Siepel's algorithm [15] over π _{ f } ; (3) add each one of the O(n ^{2}) reversals returned by Siepel's algorithm to T to build a new itrace. The complexity of this procedure is (1) + (2) + (3) = n ^{2} + n ^{3} + n ^{2}.n ^{2}, that results in O(n ^{4}).
With respect to the original algorithm, we added two new steps to the processing of an (i  1)subtrace t to generate the following isubtraces: (1B) computing the irreducible common intervals in π _{ f } ; (2B) filtering each reversal returned by Siepel's algorithm. Computing the irreducible common intervals can be done in O(n) time [21]. Filtering the reversals, that is, testing whether each one of the O(n ^{2}) reversals returned by Siepel's algorithm overlaps with each one of the irreducible common intervals can take n ^{2}.n.n, because comparing two intervals (a reversal and a common interval) takes O(n) and each reversal has to be compared to O(n) [21] irreducible common intervals. Thus, the complexity of processing an (i  1)subtrace is given by (1) + (1B) + (2) + (2B) + (3) = n ^{2} + n + n ^{3} + n ^{4} + n ^{4}, that results in O(n ^{4}). Consequently, the complexity of the modified algorithm is O( ), where L is O(N) and represents the number of computed final progressive perfect subtraces.
Observe that, to calculate perfect traces, we compute the irreducible common intervals once for the input permutation p, and then we only have to introduce the filtering step, whose complexity is O(n ^{4}), in the original algorithm. Thus, the theoretical complexity in this case is O( ), where M, the number of computed final perfect traces, is also O(N).
Experimental results
Perm.  Algorithm  N_{ S }  N_{ T }  Exec. time 

A, ℐ_{8} d = 8  all (A ↔ ℐ_{8})  81, 869  377  ≃ 5 s 
prf(A ↔ ℐ_{8})  51,304  92  ≃ 5 s  
prg (A → ℐ_{8})  11, 568  12  ≃ 3 s  
prg (ℐ_{8} → A)  8, 400  5  ≃ 2 s  
B, ℐ_{16} d = 12  all (B ↔ ℐ_{16})  505, 634, 256  21, 902  ≃ 7.3 m 
prf (B ↔ ℐ_{16})  122, 862, 960  171  ≃ 27 s  
prg (B → ℐ_{16})  5, 963, 760  6  ≃ 14 s  
prg (ℐ_{16}→ B)  5, 393, 520  9  ≃ 16 s 
Accepting common interval breaks
As mentioned, searching for perfect traces or for progressive perfect subtraces may reduce the number of sorting sequences and traces. However, there is no guarantee that these constrained traces exist, thus those approaches may eventually lead to empty results. For example, the permutation (1, 3, 2, 11, 5, 9, 10, 8, 6, 7, 4, 12), whose reversal distance is 9, has no perfect sorting sequence and no progressive perfect sorting sequence. Due to this, Braga et al. [17] proposed the construction of nearperfect traces, accepting a bounded number of breaking reversals per trace. In their approach, a reversal can have a score of 0 if it does not break any common interval, or a score of 1 if it breaks one or more common intervals. The score of a sequence of reversals is bounded by k, that is, each sorting sequence in a nearperfect trace has at most k breaking reversals.
The consequences of accepting common interval breaks have not been largely discussed by Braga et al. It was particularly not mentioned that, differently from the perfect sequences, the nearperfect sequences of reversals are asymmetric, that is, inverting a nearperfect sequence of reversals sorting a permutation π into π _{ T } with score equal to k does not necessarily result in a nearperfect sequence of reversals sorting π _{ T } into π with the same score k. The reason is that, after being broken, a common interval is no longer common and should be removed from the initial list of common intervals. Thus, the list of common intervals may be different at each step and depends on the order in which the reversals are applied. For example, considering the permutation p = (1, 3, 2, 11, 5, 9, 10, 8, 6, 7, 4, 12), there is no perfect sequence of reversals sorting π into ℐ_{12}, and we must accept at least two breaking reversals. The irreducible common intervals between these two permutations are {1, 2, 3}, {2, 3}, {2,..., 11}, {2,..., 12}, {4,..., 10}, {4,..., 11}, {4,..., 12}, {5,..., 10}, {5,..., 11}, {5,..., 12}, {5,..., 11}, {5,..., 12}, {6, 7}, {6, 7, 8}, {6, 7}, {8, 9, 10}, {9, 10}. To construct a sequence of score 2, we can first apply the nonbreaking reversals {2, 3}, {3}, {4,..., 11}, {5,..., 10}, {7} and {9} and obtain (1, 2, 3, 4, 5, 9, 10, 8, 6, 7, 11, 12). Then we apply the reversal {6, 7, 8, 10} that breaks the intervals {8, 9, 10} and {9, 10}. The next reversal is {6, 7, 9}, that breaks the interval {6, 7, 8}. Then the last reversal is {8, 9}, which is non breaking. Observe however that if we do not remove the already broken intervals from the initial list, the last reversal should be considered a breaking one (it also "breaks" the interval {9, 10}), and this sequence would have a score of 3 instead of 2. A consequence of updating the list of common intervals when we accept a number of interval breaks bounded by k is that we have nearperfect subtraces instead of traces. Similar to what happens when we use a progressive detection, only a subset of the sequences in a trace may achieve the given score k, and this process is not symmetric. Thus, when we accept interval breaks, we are not able to keep the symmetry. In other words, although the perfect traces are symmetric, the nearperfect subtraces are asymmetric and this should be taken in consideration when we apply this method to the analysis of real cases.
We can also accept interval breaks when searching for progressive perfect subtraces. As for the progressive perfect subtraces, the progressive nearperfect subtraces are also asymmetric. Nevertheless, we may use a different score system. In our model, a reversal can have a score of 0 if it does not break any common interval, or a score of 1 if one of its extremities breaks common intervals, or of 2 if both extremities break common intervals. The score of a sequence of reversals is still given by the sum of the scores of its reversals.
Reconstructing the evolutionary scenario of Rickettsia felis
Traces of sequences sorting R. felis into its ancestor
Trace  Trace normal form (f)  # seq.  # seq. 

Subtrace representative (e)  trace  subtr.  
1.  f = {2, 3}{3}{4,..., 11}{5}{5, 8, 9, 10}{7}{8, 10} < {5, 6, 7}{8, 9}  90720  45360 
e = {4,..., 11}{5, 8, 9, 10}{8, 10}{8, 9}{5, 6, 7}{2, 3}{3}{7}{5}  
2.  f = {2, 3}{3}{4,..., 11}{5,..., 10}{6}{6, 7, 8, 10}{6, 8} < {6,..., 9}{7, 8}  90720  45360 
e = {2, 3}{3}{4,..., 11}{5,..., 10}{6}{6, 7, 8, 10}{6, 8}{6,..., 9}{7, 8}  
3.  f = {2, 3}{3}{4,..., 11}{5,..., 10}{6}{6, 8, 9, 10}{8, 10} < {7,..., 10}{8, 9}  90720  45360 
e = {2, 3}{3}{4,..., 11}{5,..., 10}{6}{6, 8, 9, 10}{7,..., 10}{8, 10}{8, 9}  
4.  f = {2, 3}{3}{4,..., 11}{5,..., 10}{6, 7, 8, 10}{7}{9} < {6, 7, 9} < {8, 9}  60480  60480 
e = {2, 3}{3}{4,..., 11}{5,..., 10}{6, 7, 8, 10}{7}{9}{6, 7, 9}{8, 9}  
5.  f = {2, 3}{3}{4,..., 11}{5,..., 10}{6, 8}{9}{10} < {6, 9, 10} < {7,..., 10}  60480  0 
6.  f = {2, 3}{3}{4,..., 11}{5,..., 10}{7}{8, 10}{10} < {6, 7, 10} < {6,..., 9}  60480  0 
7.  f = {2, 3}{3}{4,..., 11}{5, 9, 10}{7}{9}{10} < {5, 8} < {5, 6, 7}  60480  60480 
e = {2, 3}{3}{4,..., 11}{5, 9, 10}{7}{9}{10}{5, 8}{5, 6, 7}  
8.  f = {2, 3}{3}{4,..., 11}{5, 8, 9, 10}{5, 9, 10}{7} < {5, 6, 7, 9, 10} < {6, 7, 8, 10} < {6,..., 9}  9072  0 
9.  f = {2, 3}{3}{4,..., 11}{5, 8, 9, 10}{6}{8, 10} < {5, 6, 8, 9} < {5, 7, 8, 9} < {6,..., 9}  6048  0 
10.  f = {2, 3}{3}{4,..., 11}{5, 9, 10}{6, 8}{10} < {5, 6, 9} < {5, 7, 8, 9} < {6,..., 9}  6048  0 
11.  f = {2, 3}{3}{4,..., 11}{6}{6, 8, 9, 10} < {5, 6, 8, 10} < {5, 6, 8, 9} < {5,..., 8}{7, 8}  6048  6048 
e = {2, 3}{3}{4,..., 11}{6}{6, 8, 9, 10}{5, 6, 8, 10}{5, 6, 8, 9}{5,..., 8}{7, 8}  
12.  f = {2, 3}{3}{4,..., 11}{5}{6, 8, 9, 10} < {5, 6, 8, 10} < {5, 7, 9} < {6, 7, 9} < {8, 9}  3024  0 
13.  f = {2, 3}{3}{4,..., 11}{6, 8} < {6, 9, 10}{7, 8} < {5, 6, 10} < {5, 6, 9} < {5,..., 8}  2520  0 
Total  546840  263088 
Final remarks
In this work we introduced a new approach to explore the universe of optimal sequences of reversals sorting a genome into another, that consists in preserving the common intervals progressively detected between the two analysed genomes. We adapted an algorithm given by Braga et al. [17], showing that, with the same theoretical complexity of the original algorithm, we can obtain all the classes of equivalent sequences of reversals that preserve entirely the common intervals progressively detected. Since we select directly the sequences that respect this constraint, our approach achieves a significative reduction of the universe of solutions and may be able to deal with more distant genomes than the original algorithm.
We showed that this approach is asymmetric, because for two given genomes A and B, the results of the analysis of the sequences sorting A into B can not be obtained from the results of the analysis of the sequences sorting B into A. However, this may be biologically valuable when the analysed genomes have a clear relation ancestordescendant. The analysis may be done from the descendant to the ancestor, as the objective is to regroup clusters of genes that existed in a past time. In other words, from the ancestor to the descendant the clusters were progressively broken.
We applied our method to analyse the evolutionary scenario between the bacterium Rickettsia felis and one of its ancestors, that was reconstructed by Blanc et al. [2]. We showed that our approach is able to provide a more complete analysis of the different possibilities of transforming the ancestor into Rickettsia felis by reversals, instead of taking an arbitrary sequence of reversals to explain a scenario, as was done by Blanc et al. In particular, we showed that the scenario proposed by Blanc et al. achieves the maximum score according to our method, but that there are also several other scenarios that achieve such maximum score.
Declarations
Acknowledgements
This work was funded by the European Union Programme Alßan (scholarship no. E05D053131BR), the French projects ANR (REGLIS NT053_45205 and MIRI BLAN081_335497), INRIA ArcoIris (associated with the University of São Paulo, Brazil) and RhôneAlpes Bioinformatics Center (PRABI).
Authors’ Affiliations
References
 Pevzner P: "Computational Molecular Biology  An Algorithmic Approach". The MIT Press
 Blanc G, Ogata H, Robert C, Audic S, Suhre K, Vestris G, Claverie JM, Raoult D: "Reductive genome evolution from the mother of Rickettsia". PLoS Genetics 2007, 3:103–114.View Article
 Hannenhalli S, Pevzner P: "Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals)". Journal of the ACM 1999, 46:1–27.View Article
 Hannenhalli S, Pevzner PA: "Transforming men into mice (polynomial algorithm for genomic distance problem)". Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science 1995, 581–592.
 Tannier E, Bergeron A, Sagot MF: "Advances on Sorting by Reversals". Discrete Applied Mathematics 2007,155(6–7):881–888. (A preliminary version appeared in CPM 2004, Lecture Notes in Computer Science, vol. 3595, 42–51).View Article
 Bader DA, Moret BME, Yan M: "A lineartime algorithm for computing inversion distances between signed permutations with an experimental study". J Comput Biol 2001,8(5):483–491.View ArticlePubMed
 Bergeron A, Mixtacki J, Stoye J: "The inversion distance problem". Mathematics of evolution and phylogeny (Edited by: Gascuel O). Oxford University Press 2005.
 Han Y: "Improving the Efficiency of Sorting by Reversals". Proceedings of The 2006 International Conference on Bioinformatics and Computational Biology CSREA Press, Las Vegas, Nevada, USA 2006.
 Moret BME, Wyman S, Bader DA, Warnow T, Yan M: "A new implementation and detailed study of breakpoint analysis". Proc 6th Pacific Symp on Biocomputing (PSB 2001) Hawaii, World Scientific Pub 2001, 583–594.
 Tesler G: "GRIMM: genome rearrangements web server". Bioinformatics 2002,18(3):492–493.View ArticlePubMed
 Diekmann Y, Sagot MF, Tannier E: "Evolution under reversals: parsimony and conservation of common intervals". IEEE/ACM Transactions on Computational Biology and Bioinformatics 2005,4(2):301–309. (A preliminary version appeared in COCOON Lecture Notes in Computer Science, vol. 3595, 42–51).View Article
 Berard S, Bergeron A, Chauve C: "Conserved structures in evolution scenarios.". RCG Lecture Notes in Bioinformatics 2005, 3388:1–15.
 Berard S, Bergeron A, Chauve C, Paul C: "Perfect sorting by reversals is not always difficult". IEEE/ACM Transactions on Computational Biology and Bioinformatics 2007,4(1):4–16.View ArticlePubMed
 Bergeron A, Heber S, Stoye J: "Common intervals and sorting by reversals: a marriage of necessity". Bioinformatics 2002,18(Suppl. 2):S54–63.PubMed
 Siepel A: "An algorithm to enumerate sorting reversals for signed permutations". J Comput Biol 2003, 10:575–597.View ArticlePubMed
 Bergeron A, Chauve C, Hartmann T, StOnge K: "On the properties of sequences of reversals that sort a signed permutation". JOBIM 2002, 99–108.
 Braga MDV, Sagot MF, Scornavacca C, Tannier E: "Exploring The Solution Space of Sorting by Reversals With Experiments and an Application to Evolution". Transactions on Comp Biology and Bioinformatics 2008,5(3):348–356. (A preliminary version appeared in ISBRA 2007, Lecture Notes in Bioinformatics vol. 4463, 293–304).View Article
 Bernt M, Merkle D, Middendorf M: "Using median sets for inferring phylogenetic trees". Bioinformatics 2007,23(2):e129–135.View ArticlePubMed
 Bader M, Abouelhoda MI, Ohlebusch E: "A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions". BMC Bioinformatics 2008, 9:516.View ArticlePubMed
 Caprara A: "The Reversal Median Problem". INFORMS Journal on Computing 2003,15(1):93–113.View Article
 Heber S, Stoye J: "Finding all common intervals of k permutations". Combinatorial Pattern Matching, 12th Annual Symposium, Lecture Notes in Computer Science 2001, 2089:207–218.
 Braga MDV: "baobabLUNA: the solution space of sorting by reversals". Bioinformatics 2009,25(14):1833–1835.View ArticlePubMed
This article is published under license to 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.