Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Algorithms in Bioinformatics

WABI 2016: Algorithms in Bioinformatics pp 269–280Cite as

A New Approximation Algorithm for Unsigned Translocation Sorting

  • Conference paper
  • First Online:

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

Abstract

Translocation has long been learned as a basic operation to rearrange genomes. Signed translocation sorting can be solved in polynomial time. Unsigned translocation sorting turns to be NP-Hard and Max-SNP-Hard. The best known algorithm by now for unsigned translocation sorting can achieve a performance ratio 1.408. In this paper, we propose a new approximation algorithm for unsigned translocation sorting, which can achieve a performance ratio 1.375 in polynomial time.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

References

  1. Bader, D.A., Bernard, M.E.M., Yan, M.: A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comput. Biol. 8(5), 483–491 (2004)

    Article  Google Scholar 

  2. Berman, P., Hannenhalli, 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)

    Chapter  Google Scholar 

  3. Caprara, A.: Sorting by reversals is difficult. In: Proceedings of RECOMB 1997, pp. 75–83 (1997)

    Google Scholar 

  4. Cui, Y., Wang, L., Zhu, D.: A 1.75-approximation algorithm for unsigned translocation distance. J. Comput. Syst. Sci. 73(7), 1045–1059 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cui, Y., Wang, L., Zhu, D., Liu, X.: A (\(1.5+\epsilon \))-approximation algorithm for unsigned translocation distance. IEEE, ACM Trans. Comput. Bioinform. 5(1), 56–66 (2008)

    Article  Google Scholar 

  6. Pradhan, G.P., Prasad, P.V.: Evaluation of wheat chromosome translocation lines for high temperature stress tolerance at grain filling stage. PLoS ONE 10(2), 1–20 (2015)

    Article  Google Scholar 

  7. Hannenhalli, S.: Polynomial-time algorithm for computing translocation distance between genomes. Discret. Appl. Math. 71(3), 137–151 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). In: STOC 1995, pp. 178–189 (1995). (J. ACM 46(1), 1–27 (1999))

    Google Scholar 

  9. Jiang, H., Wang, L., Zhu, B., Zhu, D.: A (1.408+\(\epsilon \))-approximation algorithm for sorting unsigned genomes by reciprocal translocations. In: Chen, J., Hopcroft, J.E., Wang, J. (eds.) FAW 2014. LNCS, vol. 8497, pp. 128–140. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  10. Kececioglu, J., Ravi, R.: Of mice and men: algorithms for evolutionary distance between genomes with translocation. In: SODA 1995, pp. 604–613 (1995)

    Google Scholar 

  11. Kaplan, H., Shamir, R., Tarjan, R.E.: A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Comput. 29(3), 880–892 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Bulatov, A.A., Marx, D.: Constraint satisfaction parameterized by solution size. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part I. LNCS, vol. 6755, pp. 424–436. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  13. Lou, X., Zhu, D.: A new approximation algorithm for cut-and-paste sorting of unsigned circular genomes. J. Comput. Syst. Sci. 78(4), 1099–1114 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Pu, L., Jiang, H.: Can a breakpoint graph be decomposed into none other than 2-cycles? In: Zhu, D., Bereg, S. (eds.) FAW 2016. LNCS, vol. 9711, pp. 205–214. Springer, Heidelberg (2016)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  16. Stuart, J., Lucas, B.A., Simkova, H., Kubalakov, M., Dolezel, J., Budak, H.: Next-generation sequencing of flow-sorted wheat chromosome 5D reveals lineage-specific translocations and widespread gene duplications. BMC Genomics 15, 1080 (2014)

    Article  Google Scholar 

  17. Ozery-Flato, M., Shamir, R.: An \(O(n^{\frac{3}{2}}\sqrt{\log n})\) algorithm for sorting by reciprocal translocations. J. Discret. Algorithms 9(4), 344–357 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wang, L., Zhu, D., Liu, X., Ma, S.: An \(O(n^2)\) algorithm for signed translocation. J. Comput. Syst. Sci. 70(3), 284–299 (2005)

    Article  MathSciNet  Google Scholar 

  19. Zhu, D., Wang, L.: On the complexity of unsigned translocation distance. Theor. Comput. Sci 352(3), 322–328 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Zhu, D., Ma, S.: An improved polynomial time algorithm for signed translocation sorting. J. Comput. (Chin.) 25(2), 189–196 (2002)

    MathSciNet  Google Scholar 

Download references

Acknowledgement

This paper is supported by National natural science foundation of China No 61472222.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Shandong University, Jinan, China

    Lianrong Pu, Daming Zhu & Haitao Jiang

Authors
  1. Lianrong Pu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daming Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haitao Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daming Zhu .

Editor information

Editors and Affiliations

  1. AIST and University of Tokyo , Tokyo, Japan

    Martin Frith

  2. Aarhus University, Aarhus, Denmark

    Christian Nørgaard Storm Pedersen

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Pu, L., Zhu, D., Jiang, H. (2016). A New Approximation Algorithm for Unsigned Translocation Sorting. In: Frith, M., Storm Pedersen, C. (eds) Algorithms in Bioinformatics. WABI 2016. Lecture Notes in Computer Science(), vol 9838. Springer, Cham. https://doi.org/10.1007/978-3-319-43681-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-43681-4_22

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation