I don't know if the question belongs in the stackoverflow or here, but I will post the question in here for now.

Does there exist a dynamic programming algorithm to find the longest subsequence in a string X that does not contain Y as substring? Just that this problem seems so similar to other DP string algorithms such as longest common subsequence and string.

Thanks in advanced, C