A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem

@inproceedings{Boria2016A7A,
  title={A 7/2-Approximation Algorithm for the Maximum Duo-Preservation String Mapping Problem},
  author={Nicolas Boria and Gianpiero Cabodi and Paolo Camurati and Marco Palena and Paolo Pasini and Stefano Quer},
  booktitle={CPM},
  year={2016}
}
This paper presents a simple 7/2-approximation algorithm for the max duo-preservation string mapping (MPSM) problem. This problem is complementary to the classical and well studied min common string partition problem (MCSP), that computes the minimal edit distance between two strings when the only operation allowed is to shift blocks of characters. The algorithm improves on the previously best known 4-approximation algorithm by computing a simple local optimum. 1998 ACM Subject Classification F… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Similar Papers

Loading similar papers…