module documentation
Provides the LCS and LCS_solution functions computing a longest-common substring of two strings.
Function | LCS |
Return table such that L[j][k] is length of LCS for X[0:j] and Y[0:k]. |
Function |
|
Return the longest common substring of X and Y, given LCS table L. |