User:Narenkumar123/Minimum Common Substring Problem

Minimum Common Substring Problem'

Minimum Common Substring Partition problem(MCSP) is defined as the partition problem between two strings with longest common substring .For example k-MCSP problem means that partition problem with k times occurence of each letter in both strings.Two strings are said to be related if they have same letter with same number of occurences in two strings A and B.This is approximation ratio algorithm.The approximation ratio can be Ò^(1.69).

Algorithm

1.Initially there are two strings which are related to each other.

2.There are unmarked letters in strings A and B with P and Q are empty.

3.S is longest common substring that does not contain marked letters.

4.S^A and S^B are the sets with S letters occurences in both A and B respectively.

5.Designate S^A letters as a block P in A and S^B letters as a block Q in B.

6.Mark all letters in S^A and S^B.Output P and Q.