Sciweavers

234 search results - page 2 / 47
» A genetic algorithm for the longest common subsequence probl...
Sort
View
IPPS
2003
IEEE
14 years 1 months ago
A BSP/CGM Algorithm for the All-Substrings Longest Common Subsequence Problem
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...
Carlos E. R. Alves, Edson Cáceres, Siang W....
PDP
2003
IEEE
14 years 1 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 ...
Thierry Garcia, Jean Frédéric Myoupo...
IPL
2007
99views more  IPL 2007»
13 years 8 months ago
Dynamic programming algorithms for the mosaic longest common subsequence problem
Kuo-Si Huang, Chang-Biau Yang, Kuo-Tsung Tseng, Yu...
CAI
2010
Springer
13 years 6 months ago
Constrained Longest Common Subsequence Computing Algorithms in Practice
The problem of finding a constrained longest common subsequence (CLCS) for the sequences A and B with respect to the sequence P was introduced recently. Its goal is to find a longe...
Sebastian Deorowicz, J. Obstoj
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
14 years 8 days ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
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...
Alexandre Tiskin