Sorting by translocations via reversals theory

Michal Ozery-Flato*, Ron Shamir

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationComparative Genomics RECOMB 2006 International Workshop, RCG 2006, Proceedings
PublisherSpringer Verlag
Number of pages12
ISBN (Print)3540445293, 9783540445296
StatePublished - 2006
EventRECOMB 2006 International Workshop on Comparative Genomics, RCG 2006 - Montreal, Canada
Duration: 24 Sep 200626 Sep 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4205 LNBI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceRECOMB 2006 International Workshop on Comparative Genomics, RCG 2006


Dive into the research topics of 'Sorting by translocations via reversals theory'. Together they form a unique fingerprint.

Cite this