Sorting permutations by prefix and suffix rearrangements.

Abstract excerpt

Some interesting combinatorial problems have been motivated by genome rearrangements, which are mutations that affect large portions of a genome. When we represent genomes as permutations, the goal is to transform a given permutation into the identity permutation with the minimum number of rearrangements. When they affect segments from the beginning (respectively end) of the permutation, they are called prefix...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Computational Biology
• Share to Genome