483 search results - page 92 / 97 » On perfectness of sums of graphs |
BMCBI
2006
13 years 7 months ago
2006
Background: Modeling of cis-elements or regulatory motifs in promoter (upstream) regions of genes is a challenging computational problem. In this work, set of regulatory motifs si...
CP
2011
Springer
12 years 7 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
OSDI
2006
ACM
14 years 7 months ago
2006
ACM
Automatic tools for finding software errors require a set of specifications before they can check code: if they do not know what to check, they cannot find bugs. This paper presen...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...