Longest Common Subsequence among 3 Strings?

Generalize the recurrence relation For three strings: dpi, j, k = 1 + dpi - 1, j - 1, k - 1 if Ai = Bj = Ck max(dpi - 1, j, k, dpi, j - 1, k, dpi, j, k - 1) otherwise The answer was taken from a similar question here.

Generalize the recurrence relation. For three strings: dpi, j, k = 1 + dpi - 1, j - 1, k - 1 if Ai = Bj = Ck max(dpi - 1, j, k, dpi, j - 1, k, dpi, j, k - 1) otherwise The answer was taken from a similar question here.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.