5 search results - page 1 / 1 » A BSP CGM Algorithm for the All-Substrings Longest Common Su... |
113
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
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 su...
135
Voted
PDP
2003
IEEE
15 years 8 months ago
2003
IEEE
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 ...
100
Voted
CSR
2006
Springer
15 years 6 months ago
2006
Springer
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
117
Voted
JDA
2008
15 years 2 months ago
2008
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, ...
147
Voted
CATA
2006
15 years 4 months ago
2006
The paper presents a load balancing method for some CGM (Coarse-Grained Multicomputer) algorithms. This method can be applied on different dynamic programming problems such as: Lo...