Description: The longest common sub-sequence algorithm LCS realize. Arbitrary input two strings, this algorithm can find the longest common sub-sequence.
- [StrMatch] - string comparison procedures. To compare
- [wordmatch] - a simple and effective approximate strin
- [SW-I] - Chinese word segmentation algorithm, and
- [LCS] - The largest common sub-sequences, the us
- [stringsearch] - S and T, respectively, with m and n of t
- [LCS] - The use of dynamic programming methods,
- [knap1] - The backpack is very easy to use present
- [LCS] - For two of the longest common sub-string
- [LCS] - This is the use of C++ Language of the l
- [lcs] - Longest Common Subsequence Problem. Solu
File list (Check if you may need any files):
Download