On the optimality of some group testing algorithms
On the optimality of some group testing algorithms
We consider Bernoulli nonadaptive group testing with k = Θ(η <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">θ</sup> ) defectives, for θ ϵ (0,1). The practical definite defectives (DD) detection algorithm is known to be optimal for θ > 1/2. We give a new upper bound on the rate of DD, showing that DD is …