1421 search results - page 65 / 285 » Algorithms for subsequence combinatorics |
110
click to vote
CPM
2001
Springer
15 years 7 months ago
2001
Springer
We present a solution for the following problem. Given two sequences X = x1x2 · · · xn and Y = y1y2 · · · ym, n ≤ m, find the best scoring alignment of X = Xk [i] vs Y ove...
113
click to vote
CPM
1998
Springer
15 years 7 months ago
1998
Springer
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
106
click to vote
CPM
2006
Springer
15 years 6 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...
141
click to vote
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
Consider a trader who exchanges one dollar into yen and assume that the exchange rate fluctuates within the interval [m, M]. The game ends without advance notice, then the trader ...
394
click to vote
CPM
2011
Springer
14 years 6 months ago
2011
Springer
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...