575 search results - page 2 / 115 » Computing Maximum Subsequence in Parallel |
IPPS
2003
IEEE
13 years 10 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...
FCS
2006
2006
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
13 years 6 months ago
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
PDP
2003
IEEE
13 years 10 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 ...
IPPS
2008
IEEE
13 years 11 months ago
2008
IEEE
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
