LCS(longest common subsequence):是指最长公共子序列,所谓序列是指顺序相同即可,比如abcd和acd的LCS(subsequence)是acd。
LCS(longest common substring):和上面那个差不多,但是是子串,即必须要连续的,比如abcd和acd的LCS(substring)是cd。
LCS(longest common substring)见http://blog.csdn.net/supheros/article/details/34525509
LCS(longest common subsequence)比LCS(longest common substring)稍微复杂一点,但是也用DP,也是用二维(或者多维数组),见http://blog.csdn.net/leohxj/article/details/6003430
最后说一下后缀数组:相当于是在一个字符串中需找最长的公共substring。见http://www.cnblogs.com/biyeymyhjob/archive/2012/08/15/2639572.html