Abstract
Group testing with inhibitors (GTI) is a variant of classical group testing where in addition to positive items and negative items, there is a third class of items called inhibitors. In this model the response to a test is YES if and only if the tested group of items contains at least one positive item and no inhibitor. This model of group testing has been introduced by Farach et al. (Proceedings of compression and complexity of sequences, pp 357–367, 1997) for applications in the field of molecular biology. In this paper we investigate the GTI problem both in the case when the exact number of positive items is given, and in the case when the number of positives is not given but we are provided with an upper bound on it. For the latter case, we present a lower bound on the number of tests required to determine the positive items in a completely nonadaptive fashion. Also under the same hypothesis, we derive an improved lower bound on the number of tests required by any algorithm (using any number of stages) for the GTI problem.
As far as it concerns the case when the exact number of positives is known, we give an efficient trivial two-stage algorithm. Instrumental to our results are new combinatorial structures introduced in this paper. In particular we introduce generalized versions of the well known superimposed codes (Du, D.Z., Hwang, F.K. in Pooling designs and nonadaptive group testing, 2006; Dyachkov, A.G., Rykov, V.V. in Probl. Control Inf. Theory 12:7–13, 1983; Dyachkov, A.G., et al. in J. Comb. Theory Ser. A 99:195–218, 2002; Kautz, W.H., Singleton, R.R. in IEEE Trans. Inf. Theory 10:363–377, 1964) and selectors (Clementi, A.E.F, et al. in Proceedings of symposium on discrete algorithms, pp. 709–718, 2001; De Bonis, A., et al. in SIAM J Comput. 34(5):1253–1270, 2005; Indyk, P. in Proceedings of symposium on discrete algorithms, pp. 697–704, 2002) that we believe to be of independent interest.
Similar content being viewed by others
References
Barillot E, Lacroix B, Cohen D (1991) Theoretical analysis of library screening using an n-dimensional pooling strategy. In: Nucleic acids research, pp 6241–6247
Balding DJ, Bruno WJ, Knill E, Torney DC (1996) A comparative survey of non-adaptive pooling design. In: Speed TP, Waterman MS (eds) Genetic mapping and DNA sequencing. IMA volumes in mathematics and its applications. Springer, Berlin, pp 133–154
Berger T, Mehravari N, Towsley D, Wolf J (1984) Random multiple-access communication and group testing. IEEE Trans Commun 32(7):769–779
Bruno WJ, Balding DJ, Knill E, Bruce D, Whittaker C, Dogget N, Stalling R, Torney DC (1995) Design of efficient pooling experiments. Genomics 26:21–30
Chaudhuri S, Radhakrishnan J (1996) Deterministic restrictions in circuit complexity. In: Proceedings of the twenty-eighth annual ACM symposium on the theory of computing (STOC 96), pp 30–36
Chrobak M, Gasieniec L, Rytter W (2000) Fast broadcasting and gossiping in radio networks. In: Proceedings of 42nd IEEE annual symposium on foundation of computer science (FOCS 2000), pp 575–581
Clementi AEF, Monti A, Silvestri R (2001) Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of symposium on discrete algorithms (SODA’01), pp 709–718
De Bonis A, Vaccaro U (1998) Improved algorithms for group testing with inhibitors. Inf Process Lett 66:57–64
De Bonis A, Gasieniec L, Vaccaro U (2005) Optimal two-stage algorithms for group testing problems. SIAM J Comput 34(5):1253–1270
Dorfman R (1943) The detection of defective members of large populations. Ann Math Stat 14:436–440
Du DZ, Hwang FK (2000) Combinatorial group testing and its applications. World Scientific, Singapore
Du DZ, Hwang FK (2006) Pooling designs and nonadaptive group testing. World Scientific, Singapore
Dyachkov AG, Rykov VV (1983) A survey of superimposed code theory. Probl Control Inf Theory 12(4):1–13
Dyachkov AG, Macula AJ, Torney DC, Vilenkin PA (2001) Two models of nonadaptive group testing for designing screening experiments. In: Proceedings of the 6th international workshop on model-oriented designs and analysis, pp 63–75
Dyachkov AG, Vilenkin P, Macula A, Torney D (2002) Families of finite sets in which no intersections of ℓ sets is covered by the union of s others. J Comb Theory Ser A 99:195–218
Erdös P, Frankl P, Füredi Z (1985) Families of finite sets in which no set is covered by the union of r others. Israel J Math 51:75–89
Farach M, Kannan S, Knill EH, Muthukrishnan S (1997) Group testing with sequences in experimental molecular biology. In: Carpentieri B, De Santis A, Vaccaro U, Storer J (eds) Proceedings of compression and complexity of sequences. IEEE Computer Society, Los Alamitos, pp 357–367
Hong EH, Ladner RE (2002) Group testing for image compression. IEEE Trans Image Process 11:901–911
Hong YW, Scaglione A (2004) On multiple access for distributed dependent sensors: a content-based group testing approach. In: IEEE information theory workshop, pp 298–303
Hwang FK, Liu YC (2003) Error-tolerant pooling designs with inhibitors. J Comput Biol 10(2):231–236
Indyk P (1997) Deterministic superimposed coding with application to pattern matching. In: Proceedings of thirty-ninth IEEE annual symposium on foundations of computer science (FOCS 97), pp 127–136
Indyk P (2002) Explicit constructions of selectors and related combinatorial structures, with applications. In: Proceedings of symposium on discrete algorithms 2002 (SODA 2002), pp 697–704
Kautz WH, Singleton RR (1964) Nonrandom binary superimposed codes. IEEE Trans Inf Theory 10:363–377
Knill E (1995) Lower bounds for identifying subset members with subset queries. In: Proceedings of symposium on discrete algorithms 1995 (SODA 1995), pp 369–377
Kumar R, Rajagopalan S, Sahai A (1999) Coding constructions for blacklisting problems without computational assumptions. In: Proceedings of CRYPTO ‘99. Lecture notes in computer science, vol 1666. Springer, Berlin, pp 609–623
Li CH (1962) A sequential method for screening experimental variables. J Am Stat Assoc 57:455–477
Lovàsz L (1975) On the ratio of optimal integral and fractional covers. Discret Math 13:383–390
Margaritis D, Skiena S (1995) Reconstructing strings from substrings in rounds. In: Proceedings of thirty-seventh IEEE annual symposium on foundations of computer science (FOCS 95), pp 613–620
Ngo HQ, Du D-Z (2000) A survey on combinatorial group testing algorithms with applications to DNA library screening. In: Discrete mathematical problems with medical applications. DIMACS series in discrete mathematics and theoretical computer science, vol 55. American Mathematical Society, Providence, pp 171–182
Pevzner PA, Lipshutz R (1994) Towards DNA sequencing chips. In: 19th international conference on mathematical foundations of computer science. Lecture notes in computer science, vol 841. Springer, Berlin, pp 143–158
Sobel M, Groll PA (1959) Group testing to eliminate efficiently all defectives in a binomial sample. Bell Syst Tech J 38:1179–1252
Stinson DR, Wei R, Zhu L (2000a) Some new bounds for cover-free families. J Comb Theory Ser A 90:224–234
Stinson DR, van Trung T, Wei R (2000b) Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. J Stat Plan Inference 86:595–617
Wolf J (1985) Born again group testing: multiaccess communications. IEEE Trans Inf Theory 31:185–191
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
De Bonis, A. New combinatorial structures with applications to efficient group testing with inhibitors. J Comb Optim 15, 77–94 (2008). https://doi.org/10.1007/s10878-007-9085-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9085-1