1272 search results - page 238 / 255 » The Set Cover with Pairs Problem |
BMCBI
2010
2010
An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs
13 years 10 months ago
Background: Transcription factors (TFs) control transcription by binding to specific regions of DNA called transcription factor binding sites (TFBSs). The identification of TFBSs ...
LATIN
2010
Springer
13 years 8 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
IANDC
2011
13 years 5 months ago
2011
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
CVPR
2008
IEEE
15 years 2 days ago
2008
IEEE
Nearest neighbour classifiers and related kernel methods often perform poorly in high dimensional problems because it is infeasible to include enough training samples to cover the...
ECCV
2002
Springer
14 years 12 months ago
2002
Springer
The appearance of an outdoor scene depends on a variety of factors such as viewing geometry, scene structure and reflectance (BRDF or BTF), illumination (sun, moon, stars, street l...