Sorting by Translocations Via Reversals Theory

Abstract. 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.

• Type: Conference
• Year: 2006
• Where: RECOMB
• Authors: Michal Ozery-Flato, Ron Shamir
• Keywords: Computational Biology, Major Computational Problem, Mimic Known Algorithms, RECOMB 2006, Score-based Method Building