Skip to main content
SpringerLink
Log in

A 1.375-Approximation Algorithm for Sorting by Transpositions

  • Conference paper
Book cover Algorithms in Bioinformatics (WABI 2005)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 3692))

Included in the following conference series:

Abstract

Sorting permutations by transpositions is an important problem in genome rearrangements. A transposition is a rearrangement operation in which a segment is cut out of the permutation and pasted in a different location. The complexity of this problem is still open and it has been a ten-year-old open problem to improve the best known 1.5-approximation algorithm. In this paper we provide a 1.375-approximation algorithm for sorting by transpositions. The algorithm is based on a new upper bound on the diameter of 3-permutations. In addition, we present some new results regarding the transposition diameter: We improve the lower bound for the transposition diameter of the symmetric group, and determine the exact transposition diameter of 2-permutations and simple permutations.

Work done while at the Dept. of Computer Science and Applied Mathematics, Weizmann Institute of Science.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://www.sbc.su.se/~cherub/SBT1375_proof

  2. Appel, K., Haken, W.: Every planar map is four colorable part I: Discharging. Illinois Journal of Mathematics 21, 429–490 (1977)

    MATH  MathSciNet  Google Scholar 

  3. Bader, D.A., Moret, B.M.E., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology 8(5), 483–491 (2001)

    Article  Google Scholar 

  4. Bafna, V., Pevzner, P.A.: Genome rearragements and sorting by reversals. SIAM Journal on Computing 25(2), 272–289 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM Journal on Discrete Mathematics 11(2), 224–240 (1998); Preliminary version in the Proceedings of SODA (1995)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bergeron, A.: A very elementary presentation of the Hannenhalli-Pevzner theory. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 106–117. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Berman, P., Hannanhalli, S., Karpinski, M.: 1.375-approximation algorithm for sorting by reversals. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 200–210. Springer, Heidelberg (2002)

    Google Scholar 

  8. Caprara, A.: Sorting permutations by reversals and Eulerian cycle decompositions. SIAM Journal on Discrete Mathematics 12(1), 91–110 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  9. Christie, D.A.: Genome Rearrangement Problems. PhD thesis, University of Glasgow (1999)

    Google Scholar 

  10. Eriksson, H., Eriksson, K., Karlander, J., Svensson, L., Wastlund, J.: Sorting a bridge hand. Discrete Mathematics 241(1-3), 289–300 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46, 1–27 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Hartman, T.: A simpler 1.5-approximation algorithm for sorting by transpositions. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 156–169. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Hoot, S.B., Palmer, J.D.: Structural rearrangements, including parallel inversions, within the chloroplast genome of Anemone and related genera. J. Molecular Evooution 38, 274–281 (1994)

    Google Scholar 

  14. Kaplan, H., Shamir, R., Tarjan, R.E.: Faster and simpler algorithm for sorting signed permutations by reversals. SIAM Journal of Computing 29(3), 880–892 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Lin, G.H., Xue, G.: Signed genome rearrangements by reversals and transpositions: Models and approximations. Theoretical Computer Science 259, 513–531 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  16. Meidanis, J., Walter, M.E., Dias, Z.: Transposition distance between a permutation and its reverse. In: Proceedings of the 4th South American Workshop on String Processing, pp. 70–79 (1997)

    Google Scholar 

  17. Palmer, J.D., Herbon, L.A.: Tricircular mitochondrial genomes of Brassica and Raphanus: reversal of repeat configurations by inversion. Nucleic Acids Research 14, 9755–9764 (1986)

    Article  Google Scholar 

  18. Pevzner, P.A.: Computational Molecular Biology: An Algorithmic Approach. MIT Press, Cambridge (2000)

    MATH  Google Scholar 

  19. Sankoff, D., El-Mabrouk, N.: Genome rearrangement. In: Current Topics in Computational Molecular Biology. MIT Press, Cambridge (2002)

    Google Scholar 

  20. Shamir, R.: Algorithms in molecular biology: Lecture notes (2002), Available at http://www.math.tau.ac.il/~rshamir/algmb/01/algmb01.html

  21. Tannier, E., Sagot, M.F.: Sorting by reversals in subquadratic time. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 1–13. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  22. Zwick, U.: Computer assisted proof of optimal approximability results. In: Symposium On Discrete Mathematics (SODA 2002), pp. 496–505 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Numerical Analysis and Computer Science, Royal Institute of Technology, Stockholm, Sweden

    Isaac Elias

  2. Dept. of Molecular Genetics, Weizmann Institute of Science, Rehovot, 76100, Israel

    Tzvika Hartman

Authors
  1. Isaac Elias
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tzvika Hartman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Biocomputing Group, University of Bologna, Italy

    Rita Casadio

  2. Janelia Farm Research Campus, Howard Hughes Medical Institute, Ashburn, Virginia, USA

    Gene Myers

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Elias, I., Hartman, T. (2005). A 1.375-Approximation Algorithm for Sorting by Transpositions. In: Casadio, R., Myers, G. (eds) Algorithms in Bioinformatics. WABI 2005. Lecture Notes in Computer Science(), vol 3692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557067_17

Download citation

  • DOI: https://doi.org/10.1007/11557067_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29008-7

  • Online ISBN: 978-3-540-31812-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation