An optimal design for hierarchical generalized group testing. Issue 3 (22nd April 2020)

• Record Type: Journal Article
• Authors: Malinovsky, Yaakov; Haber, Gregory; Albert, Paul S.
• Is Part Of: Journal of the Royal Statistical Society. Volume 69:Issue 3(2020)
• Page Start: 607
• Page End: 621
• Publication Date: 2020-04-22
• Subjects: Disease screening -- Dynamic programming; Statistics -- Periodicals; 519.5
• DOI: 10.1111/rssc.12409
• Languages: English
• ISSNs: 0035-9254

Abstract

Summary: Choosing an optimal strategy for hierarchical group testing is an important problem for practitioners who are interested in disease screening with limited resources. For example, when screening for infectious diseases in large populations, it is important to use algorithms that minimize the cost of potentially expensive assays. Black and co‐workers described this as an intractable problem unless the number of individuals to screen is small. They proposed an approximation to an optimal strategy that is difficult to implement for large population sizes. We develop an optimal design with respect to the expected total number of tests that can be obtained by using a novel dynamic programming algorithm. We show that this algorithm is substantially more efficient than the approach that was proposed by Black and co‐workers. In addition, we compare the two designs for imperfect tests. R code is provided for practitioners.