Density-Based group testing

Authors:
Dániel Gerbner;Balázs Keszegh;Dömötör Pálvölgyi;Gábor Wiener
Affiliations:
Rényi Institute of Mathematics, Hungarian Academy of Sciences, Hungary;Rényi Institute of Mathematics, Hungarian Academy of Sciences, Hungary;Department of Computer Science, Eötvös University, Hungary;Department of Computer Science and Information Theory, Budapest University of Technology and Economics, Hungary
Venue:
Information Theory, Combinatorics, and Search Theory
Year:
2013

Citing 3
Cited 0

Efficient algorithms for chemical threshold testing problems

Theoretical Computer Science
The Algorithmic Complexity of Chemical Threshold Testing

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Finding one of D defective elements in some group testing models

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study a new, generalized version of the well-known group testing problem. In the classical model of group testing we are given n objects, some of which are considered to be defective. We can test certain subsets of the objects whether they contain at least one defective element. The goal is usually to find all defectives using as few tests as possible. In our model the presence of defective elements in a test set Q can be recognized if and only if their number is large enough compared to the size of Q. More precisely for a test Q the answer is yes if and only if there are at least α|Q| defective elements in Q for some fixed α.