论文信息 - On Sorting by Translocations

On Sorting by Translocations

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.

Jens Stoye | Anne Bergeron | Julia Mixtacki

[1] Pavel A. Pevzner,et al. Transforming men into mice (polynomial algorithm for genomic distance problem) , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[2] Glenn Tesler,et al. Efficient algorithms for multichromosomal genome rearrangements , 2002, J. Comput. Syst. Sci..

[3] Ron Shamir,et al. Two Notes on Genome Rearrangement , 2003, J. Bioinform. Comput. Biol..

[4] Colin N. Dewey,et al. Initial sequencing and comparative analysis of the mouse genome. , 2002 .

[5] Sridhar Hannenhalli,et al. Polynomial-time Algorithm for Computing Translocation Distance Between Genomes , 1995, Discret. Appl. Math..