Abstract
Group testing, sometimes called pooling design, has been applied to a variety of problems such as blood testing, multiple access communication, coding theory, among others. Recently, screening experiments in molecular biology has become the most important application. In this paper, we review several models in this application by focusing on decoding, namely, giving a comparative study of how the problem is solved in each of these models.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alon N, Beigel R, Kasif S, Rudich S, Sudakov B (2004) Learning a hidden matching. SIAM J Comput 33:487–501
Balding DJ, Bruno WJ, Knill E, Torney DC (1996) A comparative survey of nonadaptive pooling designs. In: Genetic mapping and DNA sequencing. IMA volumes in mathematics and its applications. Springer, Berlin, pp 133–154
Chang FH, Chang HL, Hwang FK (2007) Pooling designs for clone library screening in the inhibitor complex model, to appear
Chen HB, Du DZ, Hwang FK (2007) An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. J Comb Opt, to appear
Chen HB, Fu HL, Hwang FK (2007) An upper bound of the number of tests in pooling designs for the error-tolerant complex model. Opt Lett, to appear
De Bonis A, Vaccaro U (1998) Improved algorithms for group testing with inhibitors. Inform Process Lett 67:57–64
De Bonis A, Vaccaro U (2003) Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. Theor Comput Sci 306:223– 243
De Bonis A, Gasieniec L, Vaccaro U (2005) Optimal two-stage algorithms for group testing problems. SIAM J Comput 34:1253–1270
Du DZ, Hwang FK (2000) Combinatorial group testing and its applications, 2nd ed. World Scientific, Singapore
D’yachkov AG, Rykov VV (1983) A survey of superimposed code theory. Probl Control Inf Theory 12:229–242
D’yachkov AG, Macula AJ, Torney DC, Vilenkin PA (2001) Two models of nonadaptive group testing for designing screening experiments. In: Attkinson AC, Hackl P, Muller WG (eds) Proceedings of the 6th international workshop in model oriented design and analysis. Physica, Berlin, pp 63–75
D’yachkov AG, Vilenkin PA, Macula AJ, Torney DC (2002) Families of finite sets in which no intersection of ℓ sets is covered by the union of s others. J Comb Theory Ser A 99:195–218
Farach M, Kannan S, Knill E, Muthukrishnan S (1997) Group testing problem with sequences in experimental molecular biology. In: Proceedings of the compression and complexity of sequences, pp 357–367
Hwang FK, Liu YC (2003) Error-tolerant pooling designs with inhibitors. J Comput Biol 10:231–236
Kim HK, Lebedev V (2004) On optimal superimposed codes. J Comb Des 12:79–91
Macula AJ, Popyack LJ (2004) A group testing method for finding patterns in data. Discret Appl Math 144:149–157
Mitchell CJ, Piper FC (1988) Key storage in secure networks. Discret Appl Math 21:215–228
Ngo HQ, Du DZ (2000) A survey on combinatorial group testing algorithms with applications to DNA library screening. In: DIMACS Ser Discret Math Theor Comput Sci, vol 55,. American Mathematical Society, Providence, pp 171–182
Stinson DR, Wei R (2004) Generalized cover-free families. Discret Math 279:463–477
Stinson DR, Wei R, Zhu L (2000) Some new bounds for cover-free families. J Comb Theory Ser A 90:224–234
Torney DC (1999) Sets pooling designs. Ann Comb 3:95–101
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Chen, HB., Hwang, F.K. A survey on nonadaptive group testing algorithms through the angle of decoding. J Comb Optim 15, 49–59 (2008). https://doi.org/10.1007/s10878-007-9083-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9083-3