1421 search results - page 48 / 285 » Algorithms for subsequence combinatorics |
133
click to vote
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
bzip is a program written by Julian Seward that is often used under Unix to compress single files. It splits the file into blocks which are compressed individually using a combinat...
122
click to vote
CPM
2008
Springer
15 years 4 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
119
click to vote
PR
2007
15 years 2 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...
110
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...