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 ...
163
click to vote
COCOON
15 years 10 months ago
2007 Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
124
click to vote
COCOON
15 years 10 months ago
2007 Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
|
Combinatorics