Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments

  • Nadia El-Mabrouk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1848)


Analysis of genome rearrangements allows to compare molecular data from species that diverged a very long time ago. Results and complexities are tightly related to the type of data and genome-level mutations considered. For sorted and signed data, Hannenhalli and Pevzner (HP) developed the first polynomial algorithm in the field. This algorithm solves the problem of sorting by reversals. In this paper, we show how to extend the HP approach to include insertions and deletions of gene segments, allowing to compare genomes containing different genes. We provide an exact algorithm for the asymmetric case, as applies in organellar genome evolution, and a heuristic for the symmetric case, with bounds and a diagnostic for determining whether the output is optimal.


Gene Segment Genome Rearrangement Polynomial Algorithm Oriented Cycle Cycle Graph 
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. BH96.
    P. Berman and S. Hannenhalli. Fast sorting by reversals. In D. Hirschberg and G. Myers, editors, Combinatorial Pattern Matching, Proceedings of the 7th Annual Symposium, number 1075 in Lecture Notes in Computer Science, pages 168–185. Springer, 1996.Google Scholar
  2. Cap97.
    A. Caprara. Sorting by reversals is difficult. In Proceedings of the First Annual International Conference on Computational Molecular Biology (RE-COMB 97), pages 75–83, New York, 1997. ACM.Google Scholar
  3. Cap99.
    A. Caprara. Formulations and hardness of multiple sorting by reversals. In S. Istrail, P.A. Pevzner, and M.S. Waterman, editors, Proceedings of the Third Annual International Conference on Computational Molecular Biology (RECOMB 99), pages 84–93, New York, 1999. ACM.Google Scholar
  4. Han95.
    S. Hannenhalli. Polynomial-time algorithm for computing translocation distance between genomes. In Z. Galil and E. Ukkonen, editors, Sixth Annual Symposium on Combinatorial Pattern Matching, volume 937 of Lecture Notes in Computer Science, pages 162–176, Berlin, 1995. Springer.Google Scholar
  5. HP95a.
    S. Hannenhalli and P.A. Pevzner. Transforming cabbage into turnip. (polynomial algorithm for sorting signed permutations by reversals). In Proceedings of the 27th Annual ACM-SIAM Symposium on the Theory of Computing, pages 178–189, 1995.Google Scholar
  6. HP95b.
    S. Hannenhalli and P.A. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). In Proceedings of the IEEE 36th Annual Symposium on Foundations of Computer Science, pages 581–592, 1995.Google Scholar
  7. KLRB+98._M. Korab-Laskowska, P. Rioux, N. Brossard, TG. Littlejohn, MW. Gray, BF. Lang, and G. Burger. The organelle genome database project (gobase). Nucleic Acids Res, 26:139–146, 1998.CrossRefGoogle Scholar
  8. KST97.
    H. Kaplan, R. Shamir, and R.E. Tarjan. Faster and simpler algorithm for sorting signed permutations by reversals. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 344–351, New York, 1997.Google Scholar
  9. SM-97.
    Introduction to Computational Molecular Biology. PWS Publishing Company, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Nadia El-Mabrouk
    • 1
  1. 1.Département d’informatique et de recherche opérationnelleUniversité de MontréalMontréal

Personalised recommendations