A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem

Garcia, Thierry
Myoupo, Jean-Frédéric
Semé, David

Open link

Publication date

March 2003

DOI

10.1109/EMPDP.2003.1183610

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Abstract

International audienceThe 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

Extracted data

We use cookies to provide a better user experience.

Data Protection

A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem

Abstract

Extracted data

A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem

Abstract

Extracted data

Related items

Related items