We consider the problem of group testing (pooled testing), first introduced by Dorfman. For non-adaptive testing strategies, we refer to a non-defective item as `intruding' if it only appears in positive tests. Such items cause mis-classification errors in the well-known COMP algorithm, and can make other algorithms produce an error. It is therefore of interest to understand the distribution of the number of intruding items. We show that, under Bernoulli matrix designs, this distribution is well approximated in a variety of senses by a negative binomial distribution, allowing us to understand the performance of the two-stage conservative group testing algorithm of Aldridge.

翻译：我们首先考虑由Dorfman介绍的团体测试(集体测试)问题。对于非适应性测试策略,我们称非缺陷项目为“侵入”项目,如果它只在正试验中出现的话。这类项目在众所周知的COMP算法中造成了错误分类错误,并可能使其他算法产生错误。因此,了解侵入项目数量的分布很有意义。我们表明,在Bernoulli矩阵设计中,这种分布通过负二元分布在各种感知上十分接近,使我们能够了解阿尔德里奇两阶段保守集团测试算法的性能。