Skip to main content
SpringerLink
Log in

On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time

  • Conference paper
Book cover Advances in Bioinformatics and Computational Biology (BSB 2013)

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

Included in the following conference series:

Abstract

Sorting by Transpositions is an NP-hard problem. Elias and Hartman proposed a 1.375-approximation algorithm, the best ratio so far, which runs in O(n 2) time. Firoz et al. proposed an improvement to the running time, from O(n 2) down to O(n logn), using Feng and Zhu’s permutation trees. We provide counter-examples to the correctness of Firoz et al.’s strategy, showing that it is not possible to reach a component by sufficient extensions using the method proposed by them.

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. Disc. Math. 11, 224–240 (1998)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Cunha, L.F.I.: Limites para Distância e Diâmetro em Rearranjo de Genomas por Transposições. Master dissertation, Programa de Engenharia de Sistemas e Computação – COPPE/UFRJ, Brazil (2013)

    Google Scholar 

  4. Cunha, L.F.I., Kowada, L.A.B., de A. Hausen, R., de Figueiredo, C.M.H.: Transposition diameter and lonely permutations. In: de Souto, M.C.P., Kann, M.G. (eds.) BSB 2012. LNCS (LNBI), vol. 7409, pp. 1–12. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  5. Dias, U., Dias, Z.: An improved 1.375-approximation algorithm for the transposition distance problem. In: Proceeding of the 1st ACM International Conference on Bioinformatics and Computational Biology (ACM-BCB 2010), pp. 334–337. ACM, Niagara Falls (2010)

    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) (2007) 1549–6325

    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 O(n logn) time. J. Comput. Biol. 18(8), 1007–1011 (2011)

    Article  MathSciNet  Google Scholar 

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

    Article  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  MathSciNet  MATH  Google Scholar 

  11. Hausen, R.A., Faria, L., Figueiredo, C.M.H., Kowada, L.A.B.: Unitary toric classes, the reality and desire diagram, and sorting by transpositions. SIAM J. Disc. Math. 24(3), 792–807 (2010)

    Article  MATH  Google Scholar 

  12. Kaplan, H., Verbin, E.: Efficient data structures and a new randomized approach for sorting signed permutations by reversals. In: Baeza-Yates, R., Chávez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol. 2676, pp. 170–185. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Kowada, L.A.B., de A. Hausen, R., de Figueiredo, C.M.H.: Bounds on the transposition distance for lonely permutations. In: Ferreira, C.E., Miyano, S., Stadler, P.F. (eds.) BSB 2010. LNCS (LNBI), vol. 6268, pp. 35–46. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Lopes, M.P., Braga, M.D.V., de Figueiredo, C.M.H., de A. Hausen, R., Kowada, L.A.B.: Analysis and implementation of sorting by transpositions using permutation trees. In: Norberto de Souza, O., Telles, G.P., Palakal, M. (eds.) BSB 2011. LNCS (LNBI), vol. 6832, pp. 42–49. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Sankoff, D., Leduc, G., Antoine, N., Paquin, B., Lang, B.F., Cedergren, R.: Gene sort comparisons for phylogenetic inference: evolution of the mitochondrial genome. Proc. Natl. Acad. Sci. 89(14), 6575–6579 (1992)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidade Federal do Rio de Janeiro, Brazil

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

  2. Universidade Federal Fluminense, Brazil

    Luis Antonio B. Kowada

  3. Universidade Federal do ABC, Brazil

    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. Institute of Chemistry, University of São Paulo, Avenida Prof. Lineu Prestes, 748 sala 911, 05508-000, São Paulo, SP, Brazil

    João C. Setubal

  2. School of Computing, Facom-UFMS, Federal University of Mato Grosso do Sul, CP 549, Mato Grosso do Sul, 79070-900, MS, Brazil

    Nalvo F. Almeida

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Cunha, L.F.I., Kowada, L.A.B., de A. Hausen, R., de Figueiredo, C.M.H. (2013). On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time. In: Setubal, J.C., Almeida, N.F. (eds) Advances in Bioinformatics and Computational Biology. BSB 2013. Lecture Notes in Computer Science(), vol 8213. Springer, Cham. https://doi.org/10.1007/978-3-319-02624-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-02624-4_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-02623-7

  • Online ISBN: 978-3-319-02624-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation