1421 search results - page 127 / 285 » Algorithms for subsequence combinatorics |
172
click to vote
CPM
2009
Springer
15 years 11 months ago
2009
Springer
A sequence of reversals that takes a signed permutation to the identity is perfect if it preserves all common intervals between the permutation and the identity. The problem of com...
131
click to vote
CPM
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
138
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
143
click to vote
CPM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In this paper we define a new similarity measure, the nonbreaking similarity, which is the complement of the famous breakpoint distance between genomes (in general, betw...
125
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...