9842 search results - page 1372 / 1969 » The Complexity of the Matching-Cut Problem |
163
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
306
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
206
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
176
click to vote
SIGMOD
2001
ACM
16 years 7 months ago
2001
ACM
Managing multiple versions of XML documents represents an important problem, because of many applications ranging from traditional ones, such as software configuration control, to...
172
click to vote
ICFP
2006
ACM
16 years 7 months ago
2006
ACM
Software libraries rely increasingly on iterators to provide generic traversal of data structures. These iterators can be represented either as objects that maintain state or as p...