On Sorting by Translocations

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.

DOI: 10.1007/11415770_47

Extracted Key Phrases

3 Figures and Tables

Statistics

01020'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

103 Citations

Semantic Scholar estimates that this publication has 103 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Bergeron2005OnSB, title={On Sorting by Translocations}, author={Anne Bergeron and Julia Mixtacki and Jens Stoye}, journal={Journal of computational biology : a journal of computational molecular cell biology}, year={2005}, volume={13 2}, pages={567-78} }