Skip to main content
SpringerLink
Log in

Efficient Group Testing Algorithms with a Constrained Number of Positive Responses

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8881))

Abstract

Group testing is a well known search problem that consists in detecting the defective members of a set of objects \(O\) by performing tests on properly chosen subsets (pools) of the given set \(O\). In classical group testing the goal is to find all defectives by using as few tests as possible. We consider a variant of classical group testing in which one is concerned not only with minimizing the total number of tests but aims also at reducing the number of tests involving defective elements. The rationale behind this search model is that in many practical applications the devices used for the tests are subject to deterioration due to exposure to or interaction with the defective elements. As an example, consider the leak testing procedures aimed at guaranteeing safety of sealed radioactive sources. Personnel involved in these procedures are at risk of being exposed to radiation whenever a leak in the tested sources is present. The number of positive tests admitted by a leak testing procedure should depend on the dose of radiation which is judged to be of no danger for the health. Obviously, the total number of tests should also be taken into account in order to reduce the costs and the work load of the safety personnel. In this paper we consider both adaptive and non adaptive group testing and for both scenarios we provide almost matching upper and lower bounds on the number of “yes” responses that must be admitted by any strategy performing at most a certain number \(t\) of tests. The lower bound for the non adaptive case follows from the upper bound on the optimal size of a variant of \(d\)-cover free families introduced in this paper, which we believe may be of interest also in other contexts.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

References

  1. Ahlswede, R., Deppe, C., Lebedev, V.: Threshold and majority group testing. In: Aydinian, H., Cicalese, F., Deppe, C. (eds.) Ahlswede Festschrift. LNCS, vol. 7777, pp. 488–508. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Alon, N., Asodi, V.: Learning a hidden subgraph. SIAM J. Discrete Math. 18(4), 697–712 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chen, H.B., De Bonis, A.: An almost optimal algorithm for generalized threshold group testing with inhibitors. J. Comp. Biol. 18, 851–864 (2011)

    Article  Google Scholar 

  4. Chin, F.Y.L., Leung, H.C.M., Yiu, S.M.: Non-adaptive complex group testing with multiple positive sets. Theoret. Comput. Sci. 505, 11–18 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cicalese, F., Damaschke, P., Vaccaro, U.: Optimal group testing strategies with interval queries and their application to splice site detection. Int. J. Bioinform. Res. Appl. 1(4), 363–388 (2005)

    Article  Google Scholar 

  6. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 709–718 (2001)

    Google Scholar 

  7. Damaschke, P.: Randomized group testing for mutually obscuring defectives. Inf. Process. Lett. 67, 131–135 (1998)

    Article  MathSciNet  Google Scholar 

  8. Damaschke, P., Sheikh Muhammad, A., Triesch, E.: Two new perspectives on multi-stage group testing. Algorithmica 67(3), 324–354 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  9. De Bonis, A., Ga̧sieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. Comput. 34(5), 1253–1270 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. De Bonis, A., Vaccaro, U.: Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theoret. Comput. Sci. 306, 223–243 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  11. De Bonis, A., Vaccaro, U.: Optimal algorithms for two group testing problems and new bounds on generalized superimposed codes. IEEE Trans. Inf. Theory 10, 4673–4680 (2006)

    Article  Google Scholar 

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

    Article  Google Scholar 

  13. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. World Scientific, River Edge (2000)

    MATH  Google Scholar 

  14. Du, D.Z., Hwang, F.K.: Pooling design and nonadaptive group testing. Series Appl. Math. (World Scientific), vol. 18 (2006)

    Google Scholar 

  15. Dyachkov, A.G., Rykov, V.V.: A survey of superimposed code theory. Probl. Control Inform. Theory 12, 229–242 (1983)

    MathSciNet  Google Scholar 

  16. Erdös, P., Frankl, P., Füredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51, 75–89 (1985)

    Article  Google Scholar 

  17. Harvey, N.J.A., Patrascu, M., Wen, Y., Yekhanin, S., Chan, V.W.S.: Non-adaptive fault diagnosis for all-optical networks via combinatorial group testing on graphs. In: 26th IEEE International Conference on Computer Communications, pp. 697–705 (2007)

    Google Scholar 

  18. Hong, E.S., Ladner, R.E.: Group testing for image compression. IEEE Trans. Image Process. 11(8), 901–911 (2002)

    Article  Google Scholar 

  19. Hwang, F.K., Sós, V.T.: Non adaptive hypergeometric group testing. Studia Sc. Math. Hung. 22, 257–263 (1987)

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  21. Li, C.H.: A sequential method for screening experimental variables. J. Amer. Statist. Assoc. 57, 455–477 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  22. Lo, C., Liu, M., Lynch, J.P., Gilbert, A.C.: Efficient sensor fault detection using combinatorial group testing. In: 2013 IEEE International Conference on Distributed Computing in Sensor Systems, pp. 199–206 (2013)

    Google Scholar 

  23. Porat, E., Rothschild, A.: Explicit non adaptive combinatorial group testing schemes. IEEE Trans. Inf. Theory 57(12), 7982–7989 (2011)

    Article  MathSciNet  Google Scholar 

  24. Ruszinkó, M.: On the upper bound of the size of the \(r\)-cover-free families. J. Combin. Theory Ser. A 66, 302–310 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  25. Sobel, M., Groll, P.A.: Group testing to eliminate efficiently all defectives in a binomial sample. Bell Syst. Tech. J. 38, 1179–1252 (1959)

    Article  MathSciNet  Google Scholar 

  26. Pasternack, B.S., Bohnin, D.E., Thomas, J.: Group-sequential leak-testing of sealed radium sources. Technometrics 18(1), 59–66 (1975)

    Article  Google Scholar 

  27. Thomas, J., Pasternack, B.S., Vacirca, S.J., Thompson, D.L.: Application of group testing procedures in radiological health. Health Phys. 25, 259–266 (1973)

    Article  Google Scholar 

  28. Wang, F., Du, H.D., Jia, X., Deng, P., Wu, W., MacCallum, D.: Non-unique probe selection and group testing. Theoret. Comput. Sci. 381, 29–32 (2007)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Acknowledgement

The author wishes to thank Prof. Ugo Vaccaro for the inspiring discussions.

Author information

Authors and Affiliations

  1. Diparitmento di Informatica, Università di Salerno, Fisciano, SA, Italy

    Annalisa De Bonis

Authors
  1. Annalisa De Bonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Annalisa De Bonis .

Editor information

Editors and Affiliations

  1. Zhejiang Normal University, Jinhua, Zhejiang, China

    Zhao Zhang

  2. University of Texas, Tyler, Texas, USA

    Lidong Wu

  3. University of Texas, Dallas, Texas, USA

    Wen Xu

  4. University of Texas, Dallas, USA

    Ding-Zhu Du

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

De Bonis, A. (2014). Efficient Group Testing Algorithms with a Constrained Number of Positive Responses. In: Zhang, Z., Wu, L., Xu, W., Du, DZ. (eds) Combinatorial Optimization and Applications. COCOA 2014. Lecture Notes in Computer Science(), vol 8881. Springer, Cham. https://doi.org/10.1007/978-3-319-12691-3_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12691-3_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12690-6

  • Online ISBN: 978-3-319-12691-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation