On sorting by translocations

Authors:
Anne Bergeron;Julia Mixtacki;Jens Stoye
Affiliations:
LaCIM, Université du Québec à Montréal, Canada;Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany;Technische Fakultät, Universität Bielefeld, Bielefeld, Germany
Venue:
RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Year:
2005

Citing 5
Cited 8

Polynomial-time algorithm for computing translocation distance between genomes

Discrete Applied Mathematics - Special volume on computational molecular biology
Of mice and men: algorithms for evolutionary distances between genomes with translocation

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for multichromosomal genome rearrangements

Journal of Computer and System Sciences - Computational biology 2002
Transforming men into mice (polynomial algorithm for genomic distance problem)

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On the similarity of sets of permutations and its applications to genome comparison

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Reducibility of gene patterns in ciliates using the breakpoint graph

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
A 1.75-approximation algorithm for unsigned translocation distance

Journal of Computer and System Sciences
Strategies of loop recombination in ciliates

Discrete Applied Mathematics
A Branch-and-Bound Method for the Multichromosomal Reversal Median Problem

WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Characterizing reduction graphs for gene assembly in ciliates

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Applicability of loop recombination in ciliates using the breakpoint graph

CompLife'06 Proceedings of the Second international conference on Computational Life Sciences
A 1.75-approximation algorithm for unsigned translocation distance

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The breakpoint graph in ciliates

CompLife'05 Proceedings of the First international conference on Computational Life Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchanges of chromosome ends. We give an elementary proof of the formula for computing the translocation distance in linear time, and we give a new algorithm for sorting by translocations, correcting an error in a previous algorithm by Hannenhalli.