163 search results - page 4 / 33 » Tight Approximability Results for Test Set Problems in Bioin... |
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
Raising seeds for biological experiments is prone to error; a careful experimenter will test in the lab to verify that plants are of the intended strain. Choosing a minimal set of...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
BMCBI
2010
13 years 7 months ago
2010
Background: Accurate prediction of antigenic epitopes is important for immunologic research and medical applications, but it is still an open problem in bioinformatics. The case f...
IPMI
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...