## Computing translocation distance by a genetic algorithm

- Lucas A. da Silveira, José Luis Soncco-Álvarez, Thaynara A. de Lima, Mauricio Ayala-Rincón
- 2015 Latin American Computing Conference (CLEI)
- 2015

Highly Influenced

9 Excerpts

- Published 2005 in RECOMB

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.

@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}
}