-
LCS - Longest common substring
LCS or longest common substring is a very interesting problem in computer science. Here, we have to find the maximum matching length (and the matching itself) between two strings. Current implementation in java makes use of DP problem solving strategy.
-
LCS using Dynamic Programming and LIS
Finding Longest Common Subsequence of two strings using dynamic programming and Longest Increasing Subsequence
-
Longest common subsequence problem - Python
The longest common subsequence problem in Python. Find the longest subsequence for two strings.
An example: LCSubstr_len("abab", "aabb")
Maximal length = 2 LCS string = (['ab'])