Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Integer Programming Formulation of the Minimum Common String Partition problem

Published 23 May 2014 in cs.DM, math.CO, and math.OC | (1405.6081v1)

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.

Citations (8)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. S. M. Ferdous 
  2. M. Sohel Rahman 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up