2763 search results - page 300 / 553 » The Dangerous 'All' in Specifications |
202
click to vote
COMPLIFE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper presents a method that uses gene ontologies, together with the paradigm of relational subgroup discovery, to help find description of groups of genes different...
216
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
152
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
Many algorithms for motif finding that are commonly used in bioinformatics start by sampling r potential motif occurrences from n input sequences. The motif is derived from these s...
154
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of tiling a segment {0, . . . , n} of the discrete line. More precisely, we ought to characterize the structure of the patterns that tile a segment and thei...
168
click to vote
DNA
2006
Springer
15 years 10 months ago
2006
Springer
Self-repair is essential to all living systems, providing the ability to remain functional in spite of gradual damage. In the context of self-assembly of self-repairing synthetic b...