A PC Cluster Based Parallel Algorithm for Longest Common Subsequence Problems

Finding longest common subsequence (LCS) is one of the most important bioinformatics tasks. The algorithm's time and space consumption will increase dramatically with the scale of the problem. This paper analyzed the existing LCS algorithms, and proposed a parallel algorithm. The algorithm was designed to running on PC clusters to achieve high performance. Experimental results showed that it is a practical low cost and efficient solution for sequences problem.