z-logo
Premium
Two‐Stage Hierarchical Group Testing for Multiple Infections with Application to the Infertility Prevention Project
Author(s) -
Tebbs Joshua M.,
McMahan Christopher S.,
Bilder Christopher R.
Publication year - 2013
Publication title -
biometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.298
H-Index - 130
eISSN - 1541-0420
pISSN - 0006-341X
DOI - 10.1111/biom.12080
Subject(s) - group testing , gonorrhea , pooling , computer science , test strategy , medicine , immunology , artificial intelligence , mathematics , software , combinatorics , human immunodeficiency virus (hiv) , programming language
Summary Screening for sexually transmitted diseases (STDs) has benefited greatly from the use of group testing (pooled testing) to lower costs. With the development of assays that detect multiple infections, screening practices now involve testing pools of individuals for multiple infections simultaneously. Building on the research for single infection group testing procedures, we examine the performance of group testing for multiple infections. Our work is motivated by chlamydia and gonorrhea testing for the infertility prevention project (IPP), a national program in the United States. We consider a two‐stage pooling algorithm currently used to perform testing for the IPP. We first derive the operating characteristics of this algorithm for classification purposes (e.g., expected number of tests, misclassification probabilities, etc.) and identify pool sizes that minimize the expected number of tests. We then develop an expectation–maximization (EM) algorithm to estimate probabilities of infection using both group and individual retest responses. Our research shows that group testing can offer large cost savings when classifying individuals for multiple infections and can provide prevalence estimates that are actually more efficient than those from individual testing.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here