Skip to main content
SpringerLink
Log in

The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time

  • Conference paper
WALCOM: Algorithms and Computation (WALCOM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5942))

Included in the following conference series:

Abstract

We improve the running time from O(n 2) to O(nlogn) of the existing best known 1.375−approximation algorithm for sorting by transpositions with the help of the permutation tree data structure.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11(2), 224–240 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Christie, D.: Genome rearrangement problem. Ph.D. Thesis, University of Glasgow (1999)

    Google Scholar 

  3. Elias, I., Hartman, T.: A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Trans. Comput. Biology Bioinform. 3(4), 369–379 (2006)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Feng, J., Zhu, D.: Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Transactions on Algorithms 3(3) (2007)

    Google Scholar 

  6. Gu, Q.-P., Peng, S., Sudborough, I.H.: A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theor. Comput. Sci. 210(2), 327–339 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. J. ACM 46(1), 1–27 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hartman, T., Shamir, R.: A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Inf. Comput. 204(2), 275–290 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652–686 (1985)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, BUET, Dhaka, 1000, Bangladesh

    Jesun S. Firoz, Masud Hasan, Ashik Z. Khan & M. Sohel Rahman

  2. Department of Computer Science, King’s College London, UK

    M. Sohel Rahman

Authors
  1. Jesun S. Firoz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masud Hasan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ashik Z. Khan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Sohel Rahman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (BUET), 1000, Dhaka, Bangladesh

    Md. Saidur Rahman

  2. Graduate School of Engineering, Department of Information Engineering, Hiroshima University, Kagamiyama 1-4-1, 739-8527, Higashi-Hiroshima, Japan

    Satoshi Fujita

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Firoz, J.S., Hasan, M., Khan, A.Z., Rahman, M.S. (2010). The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(nlogn) Time. In: Rahman, M.S., Fujita, S. (eds) WALCOM: Algorithms and Computation. WALCOM 2010. Lecture Notes in Computer Science, vol 5942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11440-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11440-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11439-7

  • Online ISBN: 978-3-642-11440-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation