215 search results - page 3 / 43 » A New Efficient Algorithm for Computing the Longest Common S... |
CPM
2006
Springer
13 years 9 months ago
2006
Springer
IPL
2006
13 years 5 months ago
2006
CTRSA
2009
Springer
13 years 9 months ago
2009
Springer
We design communication efficient two-party and multi-party protocols for the longest common subsequence (LCS) and related problems. Our protocols achieve privacy with respect to p...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
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...