Comparison of Group Testing Algorithms for Case Identification in the Presence of Test Error
Hae‐Young Kim, Michael G. Hudgens, Jonathan M. Dreyfuss, Daniel Westreich, Christopher D. Pilcher
Abstract
Hae‐Young Kim, Michael G. Hudgens, Jonathan M. Dreyfuss, Daniel Westreich, Christopher D. Pilcher
Abstract
We derive and compare the operating characteristics of hierarchical and square array-based testing algorithms for case identification in the presence of testing error. The operating characteristics investigated include efficiency (i.e., expected number of tests per specimen) and error rates (i.e., sensitivity, specificity, positive and negative predictive values, per-family error rate, and per-comparison error rate). The methodology is illustrated by comparing different pooling algorithms for the detection of individuals recently infected with HIV in North Carolina and Malawi.
OpenAlex reports 150 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We derive and compare the operating characteristics of hierarchical and square array-based testing algorithms for case identification in the presence of testing error. The operating characteristics investigated include efficiency (i.e., expected number of tests per specimen) and error rates (i.e., sensitivity, specificity, positive and negative predictive values, per-family error rate, and per-comparison error rate). The methodology is illustrated by comparing different pooling algorithms for the detection of individuals recently infected with HIV in North Carolina and Malawi.
Key concepts: Pooling, Group testing, Word error rate, Identification (biology), Statistics, Type I and type II errors, False discovery rate, Computer science