An Integer Programming Formulation of the Minimum Common String Partition problem
Discrete Mathematics
2015-06-22 v1 Combinatorics
Optimization and Control
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.
Keywords
Cite
@article{arxiv.1405.6081,
title = {An Integer Programming Formulation of the Minimum Common String Partition problem},
author = {S. M. Ferdous and M. Sohel Rahman},
journal= {arXiv preprint arXiv:1405.6081},
year = {2015}
}
Comments
arXiv admin note: text overlap with arXiv:1401.4539