2000 character limit reached
An Integer Programming Formulation of the Minimum Common String Partition problem (1405.6081v1)
Published 23 May 2014 in cs.DM, math.CO, and math.OC
Abstract: We consider the problem of finding a minimum common partition of two strings (MCSP). The problem has its application in genome comparison. MCSP problem is proved to be NP-hard. In this paper, we develop an Integer Programming (IP) formulation for the problem and implement it. The experimental results are compared with the previous state-of-the-art algorithms and are found to be promising.