Skip to main content
SpringerLink
Log in

A Faster 1.375-Approximation Algorithm for Sorting by Transpositions

  • Conference paper
Algorithms in Bioinformatics (WABI 2014)

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

Included in the following conference series:

Abstract

Sorting by Transpositions is an NP-hard problem for which several polynomial time approximation algorithms have been developed. Hartman and Shamir (2006) developed a 1.5-approximation algorithm, whose running time was improved to O(n logn) by Feng and Zhu (2007) with a data structure they defined, the permutation tree. Elias and Hartman (2006) developed a 1.375-approximation algorithm that runs in O(n 2) time. In this paper, we propose the first correct adaptation of this algorithm to run in O(n logn) time.

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. http://compscinet.org/research/sbt1375 (2014)

  2. Bafna, V., Pevzner, P.A.: Sorting by transpositions. SIAM J. Discrete Math. 11(2), 224–240 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bulteau, L., Fertin, G., Rusu, I.: Sorting by transpositions is difficult. SIAM J. Discrete Math. 26(3), 1148–1180 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  4. Christie, D.A.: Genome Rearrangement Problems. Ph.D. thesis, University of Glasgow, UK (1999)

    Google Scholar 

  5. Cunha, L.F.I., Kowada, L.A.B., de A. Hausen, R., de Figueiredo, C.M.H.: On the 1.375-approximation algorithm for sorting by transpositions in o(n logn) time. In: Setubal, J.C., Almeida, N.F. (eds.) BSB 2013. LNCS, vol. 8213, pp. 126–135. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  7. Feng, J., Zhu, D.: Faster algorithms for sorting by transpositions and sorting by block interchanges. ACM Trans. Algorithms 3(3), 1549–6325 (2007)

    Article  MathSciNet  Google Scholar 

  8. Firoz, J.S., Hasan, M., Khan, A.Z., Rahman, M.S.: The 1.375 approximation algorithm for sorting by transpositions can run in \(\uppercase{O}(n \log n)\) time. J. Comput. Biol. 18(8), 1007–1011 (2011)

    Article  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  10. 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 

Download references

Author information

Authors and Affiliations

  1. Universidade Federal do Rio de Janeiro, Brasil

    Luís Felipe I. Cunha & Celina M. H. de Figueiredo

  2. Universidade Federal Fluminense, Brasil

    Luis Antonio B. Kowada

  3. Universidade Federal do ABC, Brasil

    Rodrigo de A. Hausen

Authors
  1. Luís Felipe I. Cunha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luis Antonio B. Kowada
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rodrigo de A. Hausen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Celina M. H. de Figueiredo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. David R. Cheriton School of Computer Science, University of Waterloo, ON, Canada

    Dan Brown

  2. Institute of Microbiology and Genetics, Department of Bioinformatics, University of Göttingen, Germany, Goldschmidtstr. 1, 37077, Göttingen, Germany

    Burkhard Morgenstern

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cunha, L.F.I., Kowada, L.A.B., de A. Hausen, R., de Figueiredo, C.M.H. (2014). A Faster 1.375-Approximation Algorithm for Sorting by Transpositions. In: Brown, D., Morgenstern, B. (eds) Algorithms in Bioinformatics. WABI 2014. Lecture Notes in Computer Science(), vol 8701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44753-6_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-44753-6_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-44752-9

  • Online ISBN: 978-3-662-44753-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation