31 search results - page 5 / 7 » cpm 2006 |
82
Voted
CPM
2006
Springer
15 years 1 months ago
2006
Springer
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
76
Voted
CPM
2004
Springer
15 years 3 months ago
2004
Springer
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
86
Voted
CPM
2007
Springer
15 years 4 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 ...
95
Voted
CPM
2006
Springer
15 years 1 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
CPM
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...