Sciweavers

Share
PDP
2003
IEEE

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

11 years 10 months ago
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 È processors in O(ƾ È ) in time and O(È) communication steps. It is the first CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very efficient.
Thierry Garcia, Jean Frédéric Myoupo
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where PDP
Authors Thierry Garcia, Jean Frédéric Myoupo, David Semé
Comments (0)
books