Parallel longest common subsequence algorithm based on pruning technology
最长公共子序列的快速算法及其并行实现

Searching for the Longest Common Substring(LCS) of biosequences is one of the most important problems in Bioinformatics.Smith-Waterman algorithm and FASTA algorithm are currently the most widely used algorithms.FASTA algorithm runs faster than Smith-Waterman algorithm,but Smith-Waterman algorithm can obtain higher precision.A fast algorithm for LCS problem was presented.The algorithm seeks the successors of the identical character pairs in parallel according to a successor table and record their levels.Finally it traces back from identical character pair with the largest level and get the result of LCS.