64 search results - page 1 / 13 » Analysis of evolutionary algorithms for the longest common s... |
GECCO
2007
Springer
13 years 10 months 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....
TCS
2008
13 years 4 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
AAIM
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
GECCO
2006
Springer
13 years 8 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...
CPM
2007
Springer
13 years 10 months ago
2007
Springer
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos ...