Description: LCS problem for two strings is the longest common sub-string problem. Solution is to use a matrix to record the location of two strings of all the matches between the two characters in the situation, if the match is one, otherwise to 0. And one of the longest diagonal obtained sequence, the location of its corresponding sub-string match is the longest position. The longest increasing sub-sequence source C implementation of the LCS!
- [LCS] - dynamic programming solution LCS
- [vision_illumination] - illumination functions about computer gr
- [LCS] - longest common subsequence implementatio
- [lcs] - Two course design skills and analysis al
File list (Check if you may need any files):
最长递增子序列LCS的实现C源码
............................\Debug
............................\.....\LCS.exe
............................\.....\LCS.ilk
............................\.....\lcs.obj
............................\.....\LCS.pdb
............................\.....\lcsMain.obj
............................\.....\vc60.idb
............................\.....\vc60.pdb
............................\lcs.c
............................\LCS.dsp
............................\LCS.dsw
............................\lcs.h
............................\LCS.ncb
............................\LCS.opt
............................\LCS.plg
............................\lcsMain.c
Download