An easy case of sorting by reversals

  • Nicholas Tran
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1264)


We show that sorting by reversals can be performed in polynomial time when the number of breakpoints is twice the distance. This result answers an open question in [KS95].


Perfect Match Genome Rearrangement Active Interval Consecutive Element Maximal Weighted Match 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BH96]
    P. Berman and S. Hannenhalli, Fast sorting by reversal, in Proc. 7th Combinatorial Pattern Matching, 1996, pp. 168–185.Google Scholar
  2. [BP93]
    V. Bafna and P. Pevzner, Genome rearrangements and sorting by reversals, in Proc. 34th FOCS, IEEE, 1993, pp. 148–157.Google Scholar
  3. [Cap97]
    A. Caprara, Sorting by reversals is difficult, in Proc. 1st International Conference on Computational Molecular Biology, 1997.Google Scholar
  4. [GMG82]
    Z. Galil, S. Micali, and H. Gabow, Maximal weighted matching on general graphs, in Proc. 23rd FOCS, IEEE, 1982, pp. 255–261.Google Scholar
  5. [HP95]
    S. Hannenhalli and P. Pevzner, Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals), in Proc. 27th STOC, ACM, 1995, pp. 178–189.Google Scholar
  6. [HP96]
    -, To cut ⋯ or not to cut (applications of comparative physical maps in molecular evolution, in Proc. 7th SODA, ACM-SIAM, 1996, pp. 304–313.Google Scholar
  7. [KS95]
    J. Kececioglu and D. Sankoff, Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement, Algorithmica, 13 (1995), pp. 180–210.Google Scholar
  8. [KST97]
    H. Kaplan, R. Shamir, and R. Tarjan, Faster and simpler algorithm for sorting signed permutations by reversals, in Proc. 8th SODA, ACM, 1997, pp. 344–351.Google Scholar
  9. [PH88]
    J. D. Palmer and L. A. Herbon, Plant mitochondrial DNA evolves rapidly in structure, but slowly in sequence, J. of Mol. Evol., 27 (1988), pp. 87–97.Google Scholar
  10. [PW95]
    P. Pevzner and M. Waterman, Open combinatorial problems in computational molecular biology, in Proceedings of the 3rd Israel Symposium on the Theory of Computing and Systems, 1995, pp. 148–173.Google Scholar
  11. [WEHM82]
    G. A. Watterson, W. J. Ewens, T. E. Hall, and A. Morgan, The chromosome inversion problem, Journal of Theoretical Biology, 99 (1982), pp. 1–7.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Nicholas Tran
    • 1
  1. 1.Department of Computer and Information ScienceUniversity of PennsylvaniaPhiladelphia

Personalised recommendations