Skip to main content
SpringerLink
Log in

Probabilistic nonadaptive group testing in the presence of errors and DNA library screening

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

We use the subset containment relation to construct a probabilistic nonadaptive group testing design and decoding algorithm that, in the presence of testing errors, identifies many positives in a population. We give a lower bound for the expected portion of positives identified as a function of an upper bound on the number of testing errors.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D.J. Balding and D.C. Torney, Optimal pooling designs with error detection, J. Combin. Theory, Ser. A74 (1996).

  2. D.J. Balding et al., A comparative survey of non-adaptive pooling designs, In: Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and its Applications, Springer Verlag, 1995, pp. 133–155.

  3. W.J. Bruno et al., Design of efficient pooling experiments, Genomics26 (1995) 21–30.

    Google Scholar 

  4. R. Dorfman, The detection of defective members of a large population, Ann. Math. Stat.14 (1943) 436–440.

    Google Scholar 

  5. D-Z. Du and F.K. Hwang, Combinatorial Group Testing and Its Applications, World Scientific, Singapore, 1993.

    Google Scholar 

  6. A. D'yachkov, A. Macula, and V. Rykov, On optimal parameters of a class of superimposed codes and designs, submitted, 1997.

  7. A. D'yachkov and V. Rykov, Superimposed distance codes, Problems Contr. and Inf. Theory18 (1989) 237–250.

    Google Scholar 

  8. Farach et al., Group testing problems with sequences experimental molecular biology, In: Proceedings of Compression and Complexity of Sequences, 1997, B. Carpentieri et al., Eds., IEEE Press, 1994, pp. 357–367.

  9. E. Knill, Lower bounds for identifying subset members with subset queries, In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, Association for Computing Machinery and Society for Industrial and Applied Mathematics, 1995, pp. 369–377.

  10. E. Knill et al., Non-adaptive group testing in the presence of errors, Discrete Appl. Math.88 (1998) 261–290.

    Google Scholar 

  11. A. Macula, A simple construction of d-disjunct matrices with certain constant weights, Discrete Math.162 (1996) 311–312.

    Google Scholar 

  12. A. Macula, Nonadaptive group testing with error-correctingd e-disjunct matrices, Discrete Appl. Math.80 (1997) 217–282.

    Google Scholar 

  13. A. Macula, Probabilistic nonadaptive and two-stage group testing with relatively small pools and DNA library screening, J. Combin. Optimization, to appear.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, State University of New York, College at Geneseo, 14454, Geneseo, NY, USA

    Anthony J. Macula

Authors
  1. Anthony J. Macula
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The algorithms contained herein are part of The State University of New York Research Foundation invention C1230-125, Probabilistic and Combinatorial Nonadaptive and Two-Stage Group Testing and DNA Library Screening by A. Macula and K. Anne.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Macula, A.J. Probabilistic nonadaptive group testing in the presence of errors and DNA library screening. Annals of Combinatorics 3, 61–69 (1999). https://doi.org/10.1007/BF01609876

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01609876

AMS Subject Classification

Keywords

Search

Navigation