123 search results - page 2 / 25 » Algorithms for computing variants of the longest common subs... |
IPPS
2003
IEEE
13 years 11 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...
PDP
2003
IEEE
13 years 11 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 ...
GECCO
2007
Springer
14 years 13 days ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
CPM
2006
Springer
13 years 10 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
DATE
2000
IEEE
13 years 10 months ago
2000
IEEE
In [1], Murata et al introduced an elegant representation of block placement called sequence pair. All block placement algorithms which are based on sequence pairs use simulated a...