title: Optimal Configuration of a Square Array Group Testing Algorithm.
abstract: We consider the optimal configuration of a square array group testing algorithm (denoted A2) to minimize the expected number of tests per specimen. For prevalence greater than 0.2498, individual testing is shown to be more efficient than A2. For prevalence less than 0.2498, closed form lower and upper bounds on the optimal group sizes for A2 are given. Arrays of dimension 2 × 2, 3 × 3, and 4 × 4 are shown to never be optimal. The results are illustrated by considering the design of a specimen pooling algorithm for detection of recent HIV infections in Malawi.
authors.affiliation: Department of Biostatistics, University of North Carolina at Chapel Hill.
authors.forename: Michael G
authors.initials: MG
authors.lastname: Hudgens
authors.forename: Hae-Young
authors.initials: HY
authors.lastname: Kim