Research on longest common subsequence fast algorithm

In order to improve the efficiency of searching the longest common subsequence (LCS), a method of finding LCS(here, the length of the LCS p is much smaller than the length of smaller string of two strings m) is realized in this paper, which transform this problem into solving the problem of matrix L (p, m), by theorem the process of computing each element in the matrix is optimized. Algorithm analysis and experimental results show this algorithm is better than dynamic programming method. And a parallel algorithm based on OpenMP is provided in this paper, which speed of sloving large-scale data is greatly improved.