Pooling Designs and Nonadaptive Group Testing

10.1142/6122 ◽  
2006 ◽  
Author(s):  
Ding-Zhu Du ◽  
Frank K Hwang
1999 ◽  
Vol 36 (04) ◽  
pp. 951-964
Author(s):  
J. K. Percus ◽  
O. E. Percus ◽  
W. J. Bruno ◽  
D. C. Torney

We analyse the expected performance of various group testing, or pooling, designs. The context is that of identifying characterized clones in a large collection of clones. Here we choose as performance criterion the expected number of unresolved ‘negative’ clones, and we aim to minimize this quantity. Technically, long inclusion–exclusion summations are encountered which, aside from being computationally demanding, give little inkling of the qualitative effect of parametric control on the pooling strategy. We show that readily-interpreted re-summation can be performed, leading to asymptotic forms and systematic corrections. We apply our results to randomized designs, illustrating how they might be implemented for approximating combinatorial formulae.


2006 ◽  
Vol 6 (2) ◽  
pp. 490-494 ◽  
Author(s):  
Yunhui Zheng ◽  
N.P. Pitsianis ◽  
D.J. Brady

1999 ◽  
Vol 36 (4) ◽  
pp. 951-964 ◽  
Author(s):  
J. K. Percus ◽  
O. E. Percus ◽  
W. J. Bruno ◽  
D. C. Torney

We analyse the expected performance of various group testing, or pooling, designs. The context is that of identifying characterized clones in a large collection of clones. Here we choose as performance criterion the expected number of unresolved ‘negative’ clones, and we aim to minimize this quantity. Technically, long inclusion–exclusion summations are encountered which, aside from being computationally demanding, give little inkling of the qualitative effect of parametric control on the pooling strategy. We show that readily-interpreted re-summation can be performed, leading to asymptotic forms and systematic corrections. We apply our results to randomized designs, illustrating how they might be implemented for approximating combinatorial formulae.


2018 ◽  
Vol 87 (7) ◽  
pp. 1647-1656 ◽  
Author(s):  
Dongdong Jia ◽  
Sumei Zhang ◽  
Gengsheng Zhang

2016 ◽  
Vol 62 (10) ◽  
pp. 1401-1408 ◽  
Author(s):  
Kristjan Eerik Kaseniit ◽  
Mark R Theilmann ◽  
Alexander Robertson ◽  
Eric A Evans ◽  
Imran S Haque

Abstract BACKGROUND Fragile X syndrome (FXS, OMIM #300624) is an X-linked condition caused by trinucleotide repeat expansions in the 5′ UTR (untranslated region) of the fragile X mental retardation 1 (FMR1) gene. FXS testing is commonly performed in expanded carrier screening and has been proposed for inclusion in newborn screening. However, because pathogenic alleles are long and have low complexity (>200 CGG repeats), FXS is currently tested by a single-plex electrophoresis-resolved PCR assay rather than multiplexed approaches like next-generation sequencing or mass spectrometry. In this work, we sought an experimental design based on nonadaptive group testing that could accurately and reliably identify the size of abnormally expanded FMR1 alleles of males and females. METHODS We developed a new group testing scheme named StairCase (SC) that was designed to the constraints of the FXS testing problem, and compared its performance to existing group testing schemes by simulation. We experimentally evaluated SC's performance on 210 samples from the Coriell Institute biorepositories using pooled PCR followed by capillary electrophoresis on 3 replicates of each of 3 pooling layouts differing by the mapping of samples to pools. RESULTS The SC pooled PCR approach demonstrated perfect classification of samples by clinical category (normal, intermediate, premutation, or full mutation) for 90 positives and 1800 negatives, with a batch of 210 samples requiring only 21 assays. CONCLUSIONS Group testing based on SC is an implementable approach to trinucleotide repeat expansion disorder testing that offers ≥10-fold reduction in assay costs over current single-plex methods.


Sign in / Sign up

Export Citation Format

Share Document