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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Bergeron, A., Mixtacki, J., & Stoye, J. (2005). On sorting by translocations. In Lecture Notes in Bioinformatics (Subseries of Lecture Notes in Computer Science) (Vol. 3500, pp. 615–629). Springer Verlag. https://doi.org/10.1007/11415770_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
