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

  • Authors:

  • C. E. R. Alves;E. N. Cáceres;S. W. Song

  • Affiliations:

  • -;-;-

  • Venue:
  • IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given two strings X and Y of lengths mand n, respectively, the all-substrings longest common subsequence (ALCS) problem obtains the lengths of the subsequences common to X and any substring of Y . The sequential algorithm takes O(mn) time and O(n) space. We present a parallel algorithm for ALCS on a coarse-grained multicomputer (BSP/CGM) model with p