16404 search results - page 3033 / 3281 » A set coverage problem |
146
Voted
ECCC
2008
15 years 4 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
145
click to vote
EJC
2008
15 years 4 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
139
click to vote
ALMOB
2006
15 years 4 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
164
Voted
BMCBI
2006
15 years 4 months ago
2006
Background: This article addresses the problem of interoperation of heterogeneous bioinformatics databases. Results: We introduce BioWarehouse, an open source toolkit for construc...
159
click to vote
BMCBI
2006
15 years 4 months ago
2006
Background: Systems biologists work with many kinds of data, from many different sources, using a variety of software tools. Each of these tools typically excels at one type of an...