54 search results - page 2 / 11 » Constrained Longest Common Subsequence Computing Algorithms ... |
IPL
2006
13 years 7 months ago
2006
CPM
2006
Springer
13 years 11 months ago
2006
Springer
DATE
2000
IEEE
14 years 1 days 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...
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...
IPPS
2003
IEEE
14 years 27 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...