A binary search scheme for determining all contaminated specimens

From MaRDI portal




Abstract: Specimens are collected from N different sources. Each specimen has probability p of being contaminated, independently of the other specimens. Suppose we can repeatedly take small portions from several specimens, mix them together, and test the mixture for contamination, so that if the test turns positive, then at least one of the samples in the mixture is contaminated. In this paper we consider a binary search scheme for determining all contaminated specimens. More precisely, we study the number T(N) of tests required in order to find all the contaminated specimens, if this search scheme is applied. We derive recursive and, in some cases, explicit formulas for the expectation, the variance, and the characteristic function of T(N). Also, we determine the asymptotic behavior of the moments of T(N) as Noinfty and from that we obtain the limiting distribution of T(N) (appropriately normalized), which turns out to be normal.









This page was built for publication: A binary search scheme for determining all contaminated specimens

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232167)