Sorting Signed Permutations by Intergenic Reversals.

Abstract excerpt

Genome rearrangements are mutations affecting large portions of a genome, and a reversal is one of the most studied genome rearrangements in the literature through the Sorting by Reversals (SbR) problem. SbR is solvable in polynomial time on signed permutations (i.e., the gene orientation is known), and it is NP-hard on unsigned permutations. This problem (and many others considering genome rearrangements) models...

Topics

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

• Share to Algorithms
• Share to DNA, Intergenic