An Integer Programming Formulation of the Minimum Common String Partition Problem.
We consider the problem of finding a minimum common string partition (MCSP) of two strings, which is an NP-hard problem.The MCSP problem is closely related to genome comparison and rearrangement, an important field in Computational Biology.In this paper, we map Concealer the MCSP problem into Memorial Charm Car Ornament a graph applying a prior tec