@inproceedings{65c9cebc6c7446bc924142f66276216f,
title = "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.",
author = "Michal Ozery-Flato and Ron Shamir",
year = "2006",
doi = "10.1007/11864127_8",
language = "אנגלית",
isbn = "3540445293",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "87--98",
booktitle = "Comparative Genomics RECOMB 2006 International Workshop, RCG 2006, Proceedings",
note = "RECOMB 2006 International Workshop on Comparative Genomics, RCG 2006 ; Conference date: 24-09-2006 Through 26-09-2006",
}