An \(O(n^{3/2}\sqrt{\log (n)})\) Algorithm for Sorting by Reciprocal Translocations

  • Michal Ozery-Flato
  • Ron Shamir
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4009)


We prove that sorting by reciprocal translocations can be done in \(O(n^{3/2}\sqrt{\log (n)})\) for an n-gene genome. Our algorithm is an adaptation of the Tannier et. al algorithm for sorting by reversals. This improves over the O(n 3) algorithm for sorting by reciprocal translocations given by Bergeron et al.


Reciprocal Translocation Internal Edge Internal Component External Edge Discrete Apply Mathematic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Bergeron, A., Mixtacki, J., Stoye, J.: On sorting by translocations. Journal of Computational Biology 13(2), 567–578 (2006)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Hannenhalli, S.: Polynomial algorithm for computing translocation distance between genomes. Discrete Applied Mathematics 71, 137–151 (1996)CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problems). In: Proc. FOCS 1995, pp. 581–592. IEEE Computer Society Press, Los Alamitos (1995)Google Scholar
  5. 5.
    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)CrossRefMathSciNetzbMATHGoogle Scholar
  6. 6.
    Kaplan, H., Verbin, E.: Sorting signed permutations by reversals, revisited. Journal of Computer and System Sciences 70(3), 321–341 (2005)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Kececioglu, J.D., Ravi, R.: Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In: Proceedings of the 6th Annual Symposium on Discrete Algorithms, pp. 604–613. ACM Press, New York (1995)Google Scholar
  8. 8.
    Li, G., Qi, X., Wang, X., Zhu, B.: A linear-time algorithm for computing translocation distance between signed genomes. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 323–332. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Tannier, E., Bergeron, A., Sagot, M.: Advances on sorting by reversals. Discrete Applied Mathematics (to appear)Google Scholar
  10. 10.
    Wang, L., Zhu, D., Liu, X., Ma, S.: An O(n2) algorithm for signed translocation problem. In: Proc. APBC, pp. 349–358 (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michal Ozery-Flato
    • 1
  • Ron Shamir
    • 1
  1. 1.School of Computer ScienceTel-Aviv UniversityTel AvivIsrael

Personalised recommendations