Hostname: page-component-84b7d79bbc-7nlkj Total loading time: 0 Render date: 2024-07-30T04:54:06.787Z Has data issue: false hasContentIssue false
  • English
  • Français

Asymptotics of pooling design performance

Part of: Combinatorics

Published online by Cambridge University Press:  14 July 2016

J. K. Percus ,
O. E. Percus ,
W. J. Bruno  and
D. C. Torney
J. K. Percus*
Affiliation:
New York University
O. E. Percus*
Affiliation:
New York University
W. J. Bruno*
Affiliation:
Los Alamos National Laboratory
D. C. Torney*
Affiliation:
Los Alamos National Laboratory
*
∗Postal address: Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10021, USA.
∗Postal address: Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10021, USA.
∗∗∗Postal address: Theoretical Biology and Biophysics, Los Alamos National Laboratory, T-1O, MS K710, Los Alamos, New Mexico 87545, USA.
∗∗∗Postal address: Theoretical Biology and Biophysics, Los Alamos National Laboratory, T-1O, MS K710, Los Alamos, New Mexico 87545, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Keywords

Approximation techniquesasymptotic analysiscombinatorial designsdiscrete probability

MSC classification

Secondary: 05A: Enumerative combinatorics
Type
Research Papers
Information
Journal of Applied Probability , Volume 36 , Issue 4 , December 1999 , pp. 951 - 964
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Balding, D. J., and Torney, D. C. (1996). Optimal pooling designs with error detection. J. Comb. Theory A 74, 131–140.CrossRefGoogle Scholar
Balding, D. J., and Torney, D. C. (1997). The design of pooling experiments for screening a clone map. J. Fungal Genomes and Biology, 21, 302–307.Google Scholar
Balding, D. J., Bruno, W. J., Knill, E., and Torney, D. C. (1996). A comparative survey of non-adaptive pooling designs. In Genetic Mapping and DNA Sequencing, eds. Speed, T. P. and Waterman, M. S. Springer, New York, pp. 131–154.Google Scholar
Barillot, E., Lacroix, B., and Cohen, D. (1991). Theoretical analysis of library screening using a n-dimensional pooling strategy. Nucl. Acids Res. 19, 6241–6247.Google Scholar
Bruno, W. J., Knill, E., Bruce, D. C., Doggett, N. A., Sawhill, W. W., Stallings, R. L., Whittaker, C. C., and Torney, D. C. (1995). Efficient pooling designs for library screening. Genomics 26, 21–30.CrossRefGoogle ScholarPubMed
Bruno, W. J., Sun, F., and Torney, D. C. (1998). Optimizing non-adaptive group tests for objects with heterogeneous priors. SIAM J. Appl. Math. 58, 1043–1059.Google Scholar
Clarke, L., and Carbon, J. (1976). A colony bank containing synthetic ColE1 hybrid plasmids representative of the entire E. coli genome. Cell 9, 91–101.Google Scholar
Copson, E. T. (1965). Asymptotic Expansions. Cambridge University Press, Cambridge, MA.Google Scholar
Doggett, N. A. et al. (1995). An integrated physical map of human chromosome 16. Nature 377, 335S–365S.Google ScholarPubMed
Du, D. Z., and Hwang, F. K. (1993). Combinatorial Group Testing and its Applications. World Scientific Publishing, Teaneck, NJ.Google Scholar
Feller, W. (1966). An Introduction to Probability Theory and its Applications, Vol. 2, 2nd edn. Wiley, New York, p. 228.Google Scholar
Feller, W. (1968). An Introduction to Probability Theory and its Applications, Vol. 1, 3rd edn. Wiley, New York, Chapter 4.Google Scholar
Green, E. D., and Olson, M. V. (1990). Systematic screening of yeast artificial chromosome libraries by the use of the polymerase chain reaction. Proc. Nat. Acad. Sci. USA 87, 1213–1217.Google Scholar
Knill, E., Schliep, A., and Torney, D. C. (1996). Interpretation of pooling experiments using the Markov chain Monte Carlo method. J. Comp. Biol. 3, 395–406.Google Scholar
Rota, G.-C. (1964). On the foundations of combinatorial theory I. Theory of Möbius functions. Z. Wahrscheinlichkeitsth. 2, 340–368.Google Scholar
Ryser, H. J. (1963). Combinatorial Mathematics (Carus Math. Monog. 14). Quinn and Boden, Rahway, NJ.Google Scholar
Torney, D. C. (1991). Mapping using unique sequences. J. Mol. Biol. 217, 259–264.CrossRefGoogle ScholarPubMed