Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set (Article R50)

Abstract

The paper studies the following problem: given two strings, A and B, find the minimum number of reversals that transform the string A into the string B.

Keywords

• Reversal
• Distance
• Strings
• Duplicates
• Linear
• Approximation
• using
• Hitting
• Article