Group Testing Theory

Chapter
Part of the SpringerBriefs in Optimization book series (BRIEFSOPTI)

Abstract

In this chapter, we briefly present an overview of group testing, its basic theory, and construction. We also present a general framework on using group testing for several network security defense schemes as well as discuss new challenges.

References

  1. 1.
    Dorfman R (1943) The detection of defective members of large populations. Ann Math Statist 14:436–440Google Scholar
  2. 2.
    Du D-Z, Hwang FK (2006) Pooling designs: group testing in molecular biology. World Scientific, SingaporeGoogle Scholar
  3. 3.
    Thai MT, Znati T (2009) On the complexity and Approximation of non-unique probe selection using d-Disjunct Matrix. Journal of Combinatorial Optimization, special issues on Data Mining in Biomedicine 17(1):45–53Google Scholar
  4. 4.
    Thai MT, MacCallum D, Deng P, Wu W (2007) Decoding algorithms in pooling designs with inhibitors and fault tolerance. IJBRA 3(2):145–152Google Scholar
  5. 5.
    Du D-Z, Hwang FK (2000) Combinatorial group testing and its applications. World Scientific, SingaporeGoogle Scholar
  6. 6.
    Dyachkov AG, Rykov VV (1983) A survey of superimposed code theory. Prob Control Inform Thy 12:229–242Google Scholar
  7. 7.
    Dyachkov AD, Rykov VV, Rachad AM (1989) Superimposed distance codes. Prob Control Inform Thy 18:237–250Google Scholar
  8. 8.
    Eppstein D, Goodrich MT, Hirschberg D (2005) Improved combinatorial group testing algorithms for real-world problem sizes, WADS. LNCS 3608, Springer, Berlin, pp 86–98Google Scholar
  9. 9.
    Thai MT, Xuan Y, Shin I, Znati T (2008) On detection of malicious users using group testing techniques. In: Proceedings of IEEE international conference on distributed computing systems (ICDCS), pp 206–213 Google Scholar

Copyright information

© My T. Thai 2012

Authors and Affiliations

  1. 1.Department of Computer and Information Science and EngineeringUniversity of FloridaGainesvilleUSA

Personalised recommendations