Parallel computation of longest-common-subsequence

Abstract

A parallel algorithm for finding the longest common subsequence of two strings is presented. Our algorithm is executed on r processors, with r equal to the total number of pairs of positions at which two symbols match. Given two strings of length m and n respectively, m ≤ n, with preprocessing allowed, our algorithm achieves O(logρlog2n) time complexity where ρ is the longest common subsequence. Fast computing of Longest-Common-Subsequence is made possible due to the exploiting of the parallelism.