473 search results - page 10 / 95 » Heapable Sequences and Subsequences |
96
Voted
AAIM
2007
Springer
15 years 2 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...
COMBINATORICS
1998
14 years 9 months ago
1998
Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...
CCGRID
2005
IEEE
15 years 3 months ago
2005
IEEE
Once a new gene has been sequenced, it must be verified whether or not it is similar to previously sequenced genes. In many cases, the organization that sequenced a potentially n...
100
click to vote
COMBINATORICS
2007
14 years 10 months ago
2007
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...