A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem

Given two strings and of lengths Ñ and Ò, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to and any substring of . The sequential algorithm takes Ç´ÑÒµ time and Ç´Òµ space. We present a parallel algorithm for ALCS on a coarse-grained multicomputer (BSP/CGM) model with Ô ÔÑ processors that takes Ç´ÑÒ Ôµ time and Ç´Ò Ôѵ space per processor, with Ç´ÐÓ Ôµ communication rounds. The proposed parallel algorithm also solves the well-known LCS problem. To our knowledge this is the best BSP/CGM algorithm for the ALCS problem in the literature.

• Type: Conference
• Year: 2003
• Where: IPPS
• Authors: Carlos E. R. Alves, Edson Cáceres, Siang W. Song
• Keywords: Algorithm, Algorithm Takes Ç´ÑÒµ, Distributed And Parallel Computing, IPPS 2003, Parallel Algorithm