I hope you can implement a longest common subsequence algorithm in C++ based on the the journal listed below.
[url removed, login to view]
Due date of the project: End December this year.
I will like to include the extra fact that, I hope the algorithm describe in the journal can be extended X and Y are not of the same length.
Secondly, I would like to propse a second project,
I hope you all can implement a second algorithm based on the journal below
W.J. Masek and M.S. Paterson, "A faster algorithm computing string edit distances",
this is also for longest common subsequence.
J. Comput. System. Sci., 20, 18-31, (1980).