Sorting by Translocations Via Reversals Theory

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


The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of genome rearrangements that “sorts” one genome into another. In this paper we focus on sorting a multi-chromosomal genome by translocations. We reveal new relationships between this problem and the well studied problem of sorting by reversals. Based on these relationships, we develop two new algorithms for sorting by translocations, which mimic known algorithms for sorting by reversals: a score-based method building on Bergeron’s algorithm, and a recursive procedure similar to the Berman-Hannenhalli method. Though their proofs are more involved, our procedures for translocations match the complexities of the original ones for reversals.


Genome Rearrangement Recursive Algorithm Reciprocal Translocation Polynomial Algorithm 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.: A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics 146(2), 134–145 (2005)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Bergeron, A., Mixtacki, J., Stoye, J.: On sorting by translocations. Journal of Computational Biology 13(2), 567–578 (2006)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Berman, P., Hannenhalli, S.: Fast sorting by reversal. In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 168–185. Springer, Heidelberg (1996)Google Scholar
  5. 5.
    Hannenhalli, S.: Polynomial algorithm for computing translocation distance between genomes. Discrete Applied Mathematics 71, 137–151 (1996)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Hannenhalli, S., Pevzner, P.: Transforming men into mice (polynomial algorithm for genomic distance problems). In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 581–592. IEEE Computer Society Press, Los Alamitos (1995)Google Scholar
  7. 7.
    Hannenhalli, S., Pevzner, P.: Transforming cabbage into turnip: Polynomial algorithm for sorting signed permutations by reversals. Journal of the ACM 46, 1–27 (1999); Preliminary version in Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing 1995 (STOC 1995), pp. 178–189 (1995)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    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); Preliminary version in Proceedings of the eighth annual ACM-SIAM Symposium on Discrete Algorithms 1997 (SODA 1997), pp. 344–351. ACM Press, New York (1997)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kaplan, H., Verbin, E.: Sorting signed permutations by reversals, revisited. Journal of Computer and System Sciences 70(3), 321–341 (2005); A preliminary version appeared in Proc. CPM 2003, pp. 170–185. Springer, Heidelberg (2003)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    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
  11. 11.
    Nadeau, J.H., Taylor, B.A.: Lengths of chromosomal segments conserved since divergence of man and mouse. Proc. Natl. Acad. Sci. USA 81(3), 814–818 (1984)CrossRefGoogle Scholar
  12. 12.
    Ozery-Flato, M., Shamir, R.: An \(O(n^{3/2}\sqrt{\log (n)})\) algorithm for sorting by reciprocal translocations. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 258–269. Springer, Heidelberg (accepted, 2006), Available at: CrossRefGoogle Scholar
  13. 13.
    Tannier, E., Bergeron, A., Sagot, M.: Advances on sorting by reversals. Discrete Applied Mathematics (to appear)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