1421 search results - page 57 / 285 » Algorithms for subsequence combinatorics |
263
click to vote
COMPGEOM
2011
ACM
14 years 8 months ago
2011
ACM
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
160
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
245
Voted
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...
116
Voted
DM
2008
15 years 5 months ago
2008
The core of a game v on N, which is the set of additive games dominating v such that (N) = v(N), is a central notion in cooperative game theory, decision making and in combinator...
128
click to vote
SIGCSE
2008
ACM
15 years 5 months ago
2008
ACM
: The generalized problem of placing n queens on an n-by-n board provides an "embarrassingly parallel" problem for parallel solution. This paper expands on the discussion...