On Sorting by Translocations
Copyright policy )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.
- Bielefeld University Germany
- Université du Québec à Montréal Canada
- University of Quebec Canada
genome rearrangement, Chromosome Aberrations, Gene Rearrangement, DNA Mutational Analysis, Chromosome Mapping, comparative genomics, Sequence Analysis, DNA, Translocation, Genetic, sorting by translocations, Chromosome Inversion, Animals, Humans, translocation distance, Sequence Alignment, Algorithms
genome rearrangement, Chromosome Aberrations, Gene Rearrangement, DNA Mutational Analysis, Chromosome Mapping, comparative genomics, Sequence Analysis, DNA, Translocation, Genetic, sorting by translocations, Chromosome Inversion, Animals, Humans, translocation distance, Sequence Alignment, Algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).58 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!