Improved algorithms for group testing with inhibitors

Information Processing Letters

Volumn 67, Issue 2, 1998, Pages 57-64

  De Bonis, Annalisa ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Algorithms; Combinatorial problems; Cover free families; Group testing

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS;

COVER FREE FAMILIES; GROUP TESTING; INHIBITORS;

DATA PROCESSING;

EID: 0032120173     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00088-x     Document Type: Article

References (30)

1. M. Aigner, Combinatorial Search, Wiley, New York, 1988.
2. G. Ateniese, C. Blundo, A. De Santis, D.R. Stinson, Visual cryptography for general access structures, Inform, and Comput. 129 (2) (1996) 86-106.
3. E. Barillot, B. Lacroix, D. Cohen, Theoretical analysis of library screening using a n-dimensional pooling strategy, Nucleic Acids Research 19 (1991) 6241-6247.
4. J.L. Bentley, A. Yao, An almost optimal algorithm for unbounded search, Inform. Process. Lett. 5 (1976) 82-87.
5. W.J. Bruno, D.J. Balding, E.H. Knill, D. Bruce, C. Whittaker, N. Dogget, R. Stallings, D.C. Torney, Design of efficient pooling experiments, Genomics 26 (1995) 21-30.
6. B. Chor, A. Fiat, M. Naor, Tracing traitors, in: Proc. Crypto '94, Lecture Notes in Comput. Sci., Vol. 839, Springer, Berlin, 1994, pp. 257-270.
7. P. Damaschke, A parallel algorithm for nearly optimal edge search, Inform. Process. Lett. 56 (1995) 233-236.
8. P. Damaschke, The algorithmic complexity of chemical threshold testing, in: Proc. Algorithms and Complexity, CIAC '97, Lectures Notes in Comput. Sci., Vol. 1203, Springer, Berlin, 1997, pp. 215-216.
9. A. De Bonis, L. Gargano, U. Vaccaro, Improved algorithms for chemical threshold testing problems, in: Fourth Annual International Computing and Combinatorics Conference, COCOON '98, Taiwan, ROC, to be presented.
10. A. De Bonis, L. Gargano, U. Vaccaro, Group testing with unreliable tests, Inform. Sci. 96 (1-2) (1997) 1-14.
11. D.Z. Du, F.K. Hwang, Competitive group testing, in: L.A. McGeoch, D.D. Sleator (Eds.), On-Line Algorithm, DIMACS Series in Discrete Math. and Theoret. Comput. Sci., Vol. 7, AMS & AMC, 1992, pp. 125-134.
12. D.Z. Du, F.K. Hwang, Combinatorial Group Testing and its Applications, World Scientific, Singapore, 1993.
13. D.Z. Du, H. Park, On competitive group testing, SIAM J. Comput. 23 (5) (1994) 1019-1025.
14. D.Z. Du, G.L. Xue, S.Z. Sun, S.W. Cheng, Modifications of competitive group testing, SIAM J. Comput. 23 (1) (1994) 82-96.
15. A.G. Dyachkov, V.V. Rykov, Bounds on the length of disjunctive codes, Prob. Control Inform. Theory 11 (1982) 7-13.
16. P. Erdös, P. Frankl, Z. Füredi, Families of finite sets in which no set is covered by the union of r others, J. Combin. Theory Ser. A 33 (1982) 158-166.
17. M. Farach, S. Kannan, E.H. Knill, S. Muthukrishnan, Group testing with sequences in experimental molecular biology, in: B. Carpentieri, A. De Santis, J. Storer, U. Vaccaro (Eds.), Proc. of Compression and Complexity of Sequences, IEEE Computer Society, 1997, pp. 357-367.
18. L. Gargano, J. Körner, U. Vaccaro, Search problems for two irregular coins with incomplete feedback: the underweight model. Discrete Appl. Math. 36 (1992) 191-197.
19. B. Gluss, A method for obtaining suboptimal group-testing polices using dynamic programming and information theory, J. ACM 10 (1) (1963) 89-96.
20. F.K. Hwang, P.J. Wan, Comparing file copies with at most three disagreeing pages, IEEE Trans. Comput. 46 (6) (1997) 716-718.
21. P. Indyk, Deterministic superimposed coding with application to pattern matching, in: Proc. of Foundations of Computer Science (FOCS 97), Miami, FL, IEEE Press, 1997, pp. 127-136.
22. E. Knill, Lower bounds for identifying subset members with subset queries, in: Proc. Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. San Francisco, CA, 1995, pp. 369-377.
23. C.H. Li, A sequential method for screening experimental variables, J. ACM 57 (1962) 455-477.
24. W.H. Kautz, R.R. Singleton, Nonrandom binary superimposed codes, IEEE Trans. Inform. Theory 10 (1964) 363-377.
25. Q.A. Nguyen, T. Zeisel, Bounds on constant weight binary superimposed codes, Probl. Control Inform. Theory 17 (1988) 223-230.
26. M. Ruszinkó, On the upper bound of the size of the r-cover-free families, J. Combin. Theory Ser. A 66 (1994) 302-310.
27. M. Sobel, P.A. Groll, Group testing to eliminate efficiently all defectives in a binomial sample, Bell System Tech. J. 28 (1959) 1179-1252.
28. E. Sperner, Ein Satz über Untermengen einer endlichen Menge, Math. Z. 27 (1928) 544-548.
29. M. Szegedy, S. Vishwanathan, Locality based graph coloring, in: Proc. Twenty-Fifth Ann. ACM Symposium on Theory of Computing (STOC 93), San Diego, CA, ACM Press, 1993, pp. 201-207.
30. J.K. Wolf, Born again group testing: Multiaccess communications, IEEE Trans. Inform. Theory IT-31 (1985) 185-191.