10 search results - page 1 / 2 » Finding Maximal Pairs with Bounded Gap |
CPM
1999
Springer
13 years 10 months ago
1999
Springer
DLT
2006
13 years 7 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
RECOMB
2004
Springer
14 years 6 months ago
2004
Springer
Identifying gene clusters, genomic regions that share local similarities in gene organization, is a prerequisite for many different types of genomic analyses, including operon pred...
BMCBI
2007
13 years 6 months ago
2007
Over the last two decades a large number of algorithms has been developed for regulatory motif finding. Here we show how many of these algorithms, especially those that model bind...
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...