Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

PDP
2003
IEEE

favoriteEmaildiscussreport

160views Distributed And Parallel Com...» more PDP 2003»

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

13 years 9 months ago

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

Download pro.garnathy.com

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 ﬁrst CGM algorithm for this problem. We present also experimental results showing that the CGM algorithm is very efﬁcient.

Thierry Garcia, Jean Frédéric Myoupo

Real-time Traffic

CGM Algorithm | Coarse-Grained Multicomputer Algorithm | Distributed And Parallel Computing | PDP 2003 | ﬁrst Cgm Algorithm |

claim paper

Related Content

» A Load Balancing Technique for Some CoarseGrained Multicomputer Algorithms

» A BSPCGM Algorithm for the AllSubstrings Longest Common Subsequence Problem

» A genetic algorithm for the longest common subsequence problem

» Algorithms for Computing the Longest Parameterized Common Subsequence

» Analysis of evolutionary algorithms for the longest common subsequence problem

» Algorithms for computing variants of the longest common subsequence problem

» Dynamic programming algorithms for the mosaic longest common subsequence problem

» Constrained Longest Common Subsequence Computing Algorithms in Practice

» A New Efficient Algorithm for Computing the Longest Common Subsequence

Post Info
More Details (n/a)

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)