Skip to main content
SpringerLink
Log in

A Comparative Survey of Non-Adaptive Pooling Designs

  • Conference paper
Genetic Mapping and DNA Sequencing

Part of the book series: The IMA Volumes in Mathematics and its Applications ((IMA,volume 81))

Abstract

Pooling (or “group testing”) designs for screening clone libraries for rare “positives” are described and compared. We focus on non-adaptive designs in which, in order both to facilitate automation and to minimize the total number of pools required in multiple screenings, all the pools are specified in advance of the experiments. The designs considered include deterministic designs, such as set-packing designs, the widely-used “row and column” designs and the more general “transversal” designs, as well as random designs such as “random incidence” and “random k- set” designs. A range of possible performance measures is considered, including the expected numbers of unresolved positive and negative clones, and the probability of a one-pass solution. We describe a flexible strategy in which the experimenter chooses a compromise between the random k-set and the set-packing designs. In general, the latter have superior performance while the former are nearly as efficient and are easier to construct.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amemiya C. T., Alegria-Hartman M. J., Aslanidis C., Chen, C, Nikolic J., Gingrich, J. C, and de Jong, P. J. (1992) A two-dimensional YAC pooling strategy for library screening via STS and Alu-PCK methods. Nuci Acids Res. 20 2559–2563.

    Article  Google Scholar 

  2. Anderson, I. (1990) Combinatorial Designs: Construction Methods. Ellis Horwood, Chichester.

    MATH  Google Scholar 

  3. Balding, D.J. and Torney, D.C. (1996) Optimal pooling designs with error detection. J. Comb. Th. A 74 131–140.

    Article  MathSciNet  MATH  Google Scholar 

  4. Barillot E., Lacroix B., and Cohen, D. (1991) Theoretical analysis of library screening using a n-dimensional pooling strategy. Nuci. Acids Res. 19 6241–6247.

    Article  Google Scholar 

  5. Beth T., Jungnickel D. and Lenz H. (1986) Design Theory. Cambridge University Press, Cambridge.

    MATH  Google Scholar 

  6. Bruno, W.J., Knill E., Balding, D.J., 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.

    Article  Google Scholar 

  7. Chumakov I., Rigault P., Guillou S., Ougen P., Billaut A., Guasconi G., Gervy P., LeGall I., Soularue P., Grinas L., Bougueleret L., Bellané-Chantelot C., Lacroix B., Barillot E., Gesnouin P., Pook S., Vaysseix G., Frelat G., Schmitz A., Sambucy, J.-L., Bosch A., Estivill X., Weissenbach J., Vignal A., Reithman H., Cox D., Patterson D., Gardiner K., Hattori M., Sataki Y., Ichikawa H., Ohki M., Le Paslier D., Heilig R., Antonarakis S., and Cohen, D. (1992) Continuum of overlapping clones spanning the entire human chromosome 21q. Nature (London) 359 380–387.

    Article  Google Scholar 

  8. Damaschke, Peter (1994) A tight upper bound for group testing in graphs. Discrete App. Math. 48 101–109.

    Article  MathSciNet  MATH  Google Scholar 

  9. Dorfman R. (1943) The detection of defective members of large populations. Ann. Math. Statist. 14 436–440.

    Article  Google Scholar 

  10. Du, D. Z. and Hwang, F. K. (1993) Combinatorial Group Testing and Applications. World Scientific Publishing, Singapore.

    MATH  Google Scholar 

  11. Dyachov, A.G. (1979) Bounds on the error probability for certain ensembles of random codes (Russian). Problemy Peredachi Informatsii 15 23–35.

    Google Scholar 

  12. Dyachov, A. G. (1979) Error probability bounds for two models of randomized design of elimination experiments (Russian). Problemy Peredachi Informatsii 15 17–31.

    MathSciNet  Google Scholar 

  13. Dyachov, A. G. and Rykov, V. V. (1980) Bounds on the length of disjunctive codes (Russian). Problemy Peredachi Informatsii 18 7–13.

    Google Scholar 

  14. Dyachov, A. G. and Rykov, V. V. (1983) A survey of superimposed code theory. Problems of Control and Information Theory 12 1–13.

    Google Scholar 

  15. Dyachov A. G., Rykov, V. V. and Rashad, A. M. (1989) Superimposed distance codes. Problems of Control and Information Theory 18 237–250.

    Google Scholar 

  16. Erdös P. Frankl P. and Furedi Z. 1985 Families of finite sets in which set is covered by the union of r others. Israel J. Math. 51 79–89

    Google Scholar 

  17. Evans, G. A. and Lewis, K. A. (1989) Physical mapping of complex genomes by cosmid multiplex analysis. Proc. Natl. Acad. Sci. USA 86 5030–5034.

    Article  Google Scholar 

  18. Gerardin, A. (1916) Sphinx-Oedipe 11 68–70.

    Google Scholar 

  19. Gille, C, Grade, K. and Coutelle, C. (1991) A pooling strategy for heterozygote screening of the ▵F508 cystic fibrosis mutation. Hum. Genet. 86 289–291.

    Article  Google Scholar 

  20. Green, E. D. and Olson, M. V. (1990) Systematic screening of yeast artificial chromosome libraries by the use of the polymerase chain reaction. Proc. Natl.Acad. Sci. USA 87 1213–1217.

    Article  Google Scholar 

  21. Hirschfeld, D. R. H. and Thal, J. A. (1991) General Galois Geometries.Clarendon Press, Oxford.

    MATH  Google Scholar 

  22. Hughes, D. R. (1965) On t-designs and groups. Am. J. Math. 87 761–778.

    Article  MATH  Google Scholar 

  23. Hwang, F. K. (1984) Robust Group Testing. J. of Quality Technology 16 189–195.

    Google Scholar 

  24. Hwang, F. K. and Sós, V. T. (1987) Non-adaptive hypergeometric group testing. Stud. Sci. Math. Hung. 22 257–263.

    MATH  Google Scholar 

  25. Kraitchik, M. (1930, 1953) Mathématique des jeux ou recreations mathématiques (Mathematical recreations). Dover Publications (2nd rev. ed.), New York.

    Google Scholar 

  26. Kautz, W. H. and Singleton, R. C. (1964) Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10 363–377.

    Article  MATH  Google Scholar 

  27. Knill, E. (1995) Lower bounds for identifying subset members with subset queries. Proceedings of the sixth annual Symposium on Discrete Algorithms, 369–377.

    Google Scholar 

  28. McCormick, M.K., Buckler A., Bruno, W.J., Campbell E., Shera K., Torney D., Deaven L., and Moyzis, R. (1993) Construction and Characterization of a YAC Library with a Low Frequency of Chimeric Clones from Flow Sorted Human Chromosome 9. Genomics 18 553–558.

    Article  Google Scholar 

  29. Muthukrishnan, S. (1993) On optimal strategies for searching in the presence of errors. Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms 680–689.

    Google Scholar 

  30. Olson M., Hood L., Cantor, C, and Botstein, D. (1989) A common language for physical mapping of the human genome. Science 245 1434–1435.

    Article  Google Scholar 

  31. Rödl, V. (1985) On a packing and covering problem. Europ. J. Combinatorics 5 69–78.

    Google Scholar 

  32. Ruszinkó M. (1994) On the upper bound of the size of the r-cover-free families. J. Comb. Th. A 66 302–310.

    Article  MATH  Google Scholar 

  33. Schneider, H. and Tang, K. (1990) Adaptive procedures for the two-stage group-testing problem based on prior distributions and costs. Technometrics 32 397–405.

    Article  MathSciNet  Google Scholar 

  34. Simon R. J., Kania R. S., Zuckermann R. N., Huebner V. D., Jewell D. A., Banville S., Ng, S., Wang L., Rosenberg S., Marlowe, C. Spellmeyer, D. C, Tan R., Frankel A. D., Santi D. V., Cohen F. E., and Bartlett, P. A. (1992) Peptoids: A modular approach to drug discovery. Proc. Natl. Acad. Sci. USA 89 9367–9371.

    Article  Google Scholar 

  35. Sloan D. D., Blanchard M. M., Burough F. W., and Nowotony, V. (1993) Screening YAC libraries with robot-aided automation. Gen. Anal. Tech. Appl. 10 128–143.

    Google Scholar 

  36. Sobel, M. and Groll, P. A. (1959) Group testing to eliminate efficiently all defectives in a binomial sample, Bell System Tech. J. 28 1179–1252.

    MathSciNet  Google Scholar 

  37. Stinson, D. R. (1985) Hill-climbing algorithms for the construction of combinatorial designs. Ann. of Discr. Math. 26 321–334.

    Article  Google Scholar 

  38. Ulam, S. (1977) Adventures of a Mathematician. Scribners, New York.

    Google Scholar 

  39. Wolf, J.K. (1985) Born again group testing: multiaccess communications. IEEE Trans. Inf. Theory it-31 185–191.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Queen Mary and Westfield College, University of London, Mile End Road, London, E1 4NS, UK

    D. J. Balding

  2. Department Applied Statistics, University of Reading, PO Box 240, Reading, RG6 2FN, UK

    D. J. Balding

  3. Theoretical Biology and Biophysics Group, Los Alamos National Laboratory, Mail Stop K-710, Los Alamos, New Mexico, 87545

    W. J. Bruno & D.C Torney

  4. Computer Research and Applications, Los Alamos National Laboratory, Mail Stop B-265, Los Alamos, New Mexico, 87545

    E. Knill

Authors
  1. D. J. Balding
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. J. Bruno
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D.C Torney
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. E. Knill
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Statistics, University of California at Berkeley, Evans Hall 367, Berkeley, CA, 94720-3860, USA

    Terry Speed

  2. Department of Mathematics and Molecular Biology, University of Southern California, 1042 W. 36th Place, DRB 155, Los Angeles, CA, 90089-1113, USA

    Michael S. Waterman

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this paper

Cite this paper

Balding, D.J., Bruno, W.J., Torney, D., Knill, E. (1996). A Comparative Survey of Non-Adaptive Pooling Designs. In: Speed, T., Waterman, M.S. (eds) Genetic Mapping and DNA Sequencing. The IMA Volumes in Mathematics and its Applications, vol 81. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-0751-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0751-1_8

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-6890-1

  • Online ISBN: 978-1-4612-0751-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation