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.
Bergeron
Anne
A
Département d'informatique, Université du Québec à Montréal, Canada.
Mixtacki
Julia
J
Stoye
Jens
J
D000465:Algorithms; D000818:Animals; D002869:Chromosome Aberrations; D007446:Chromosome Inversion; D002874:Chromosome Mapping / Q000379:methods*; D004252:DNA Mutational Analysis; D015321:Gene Rearrangement; D006801:Humans; D016415:Sequence Alignment / Q000379:methods*; D017422:Sequence Analysis, DNA / Q000379:methods*; D014178:Translocation, Genetic / Q000235:genetics*