60
Voted
CPM
2007
Springer
15 years 5 months ago
2007
Springer
In this paper a deterministic algorithm for the length reduction problem is presented. This algorithm enables a new tool for performing fast convolution in sparse data. While the ...
75
Voted
CPM
2007
Springer
15 years 5 months ago
2007
Springer
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
123
click to vote
CPM
2007
Springer
15 years 5 months ago
2007
Springer
Extracting motifs from a set of DNA sequences is important in computational biology. Occurrence probability is a common used statistics to evaluate the statistical significance of...
55
Voted
CPM
2007
Springer
15 years 5 months ago
2007
Springer
88
Voted
CPM
2007
Springer
15 years 5 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 ...
CPM
2007
Springer
15 years 5 months ago
2007
Springer
60
Voted
CPM
2007
Springer
15 years 5 months ago
2007
Springer
CPM
2007
Springer
15 years 5 months ago
2007
Springer
44
Voted
CPM
2007
Springer
15 years 5 months ago
2007
Springer
72
Voted
CPM
2007
Springer
15 years 5 months ago
2007
Springer
