11 search results - page 1 / 3 » All Semi-local Longest Common Subsequences in Subquadratic T... |
CSR
2006
Springer
13 years 11 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...
JDA
2008
13 years 7 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, ...
IPPS
2003
IEEE
14 years 21 days 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...
IJCAI
2007
13 years 8 months ago
2007
Time series data abounds in real world problems. Measuring the similarity of time series is a key to solving these problems. One state of the art measure is the longest common sub...
GECCO
2006
Springer
13 years 11 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...