1421 search results - page 4 / 285 » Algorithms for subsequence combinatorics |
COMBINATORICS
2002
13 years 5 months ago
2002
Inspired by the results of Baik, Deift and Johansson on the limiting distribution of the lengths of the longest increasing subsequences in random permutations, we find those limit...
COMBINATORICS
2004
13 years 5 months ago
2004
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
COMBINATORICS
2004
13 years 5 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
COCOON
2001
Springer
13 years 9 months ago
2001
Springer