1421 search results - page 2 / 285 » Algorithms for subsequence combinatorics |
COMBINATORICS
2007
13 years 4 months ago
2007
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
COMBINATORICS
2002
13 years 4 months ago
2002
Erdos and Szekeres showed that any permutation of length n k2 + 1 contains
CPM
1992
Springer
13 years 8 months ago
1992
Springer
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 ...