Sorting permutations by tanspositions

@inproceedings{Bafna1995SortingPB,
  title={Sorting permutations by tanspositions},
  author={Vineet Bafna and Pavel A. Pevzner},
  booktitle={SODA '95},
  year={1995}
}
Vineet Bafnat Sequence comparison in computational molecular biology is a powerful tool for deriving evolutionary and functional relationships between genes. However, classical alignment algorithms handle only local mutations (i.e. insertions, deletions and substitutions of nucleotides) and ignore global rearrangements (i.e. inversions and transpositions of long fragments). As a result, the applications of sequence alignment to analyze highly rearranged genomes (i.e. herpes viruses or plant… CONTINUE READING