This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Perfect Sorting by Reversals Is Not Always Difficult
January-March 2007 (vol. 4 no. 1)
pp. 4-16
We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sorting signed permutations by reversals without breaking common intervals. We describe a combinatorial framework for this problem that allows us to characterize classes of signed permutations for which one can compute, in polynomial time, a shortest reversal scenario that conserves all common intervals. In particular, we define a class of permutations for which this computation can be done in linear time with a very simple algorithm that does not rely on the classical Hannenhalli-Pevzner theory for sorting by reversals. We apply these methods to the computation of rearrangement scenarios between permutations obtained from 16 synteny blocks of the X chromosomes of the human, mouse, and rat.
Index Terms:
Evolution scenarios, reversals, common intervals.
Citation:
S?verine B?rard, Anne Bergeron, Cedric Chauve, Christophe Paul, "Perfect Sorting by Reversals Is Not Always Difficult," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 4, no. 1, pp. 4-16, Jan.-March 2007, doi:10.1109/TCBB.2007.1011
Usage of this product signifies your acceptance of the Terms of Use.