1871 search results - page 319 / 375 » The Ephemeral Pairing Problem |
186
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
172
click to vote
BMCBI
2010
2010
An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs
15 years 6 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 ...
187
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...
180
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
200
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: Protein identification is one of the most challenging problems in proteomics. Tandem mass spectrometry provides an important tool to handle the protein identification ...