A coarse-grained multicomputer algorithm for the longest common subsequence problem

The paper presents a coarse-grained multicomputer algorithm that solves the Longest Common Subsequence Problem. This algorithm can be implemented in the CGM with P processors in O(N/sup 2//P) in time and O(P) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very efficient.