165
click to vote
CPM
15 years 10 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...
136
click to vote
CPM
15 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 ...
102
click to vote
CPM
15 years 10 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 ...
126
click to vote
CPM
15 years 8 months ago
2007 Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
|
Combinatorics