2019
DOI: 10.1561/0100000099
|View full text |Cite
|
Sign up to set email alerts
|

Group Testing: An Information Theory Perspective

Abstract: The group testing problem concerns discovering a small number of defective items within a large population by performing tests on pools of items. A test is positive if the pool contains at least one defective, and negative if it contains no defectives. This is a sparse inference problem with a combinatorial flavour, with applications in medical testing, biology, telecommunications, information technology, data science, and more.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
201
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
3
2

Relationship

1
8

Authors

Journals

citations
Cited by 185 publications
(202 citation statements)
references
References 167 publications
1
201
0
Order By: Relevance
“…If a pool of n samples tests negative, all samples must be negative, and therefore their status has been determined in only one test instead of n individual tests. Various group testing algorithms exist, with different assumptions and constraints [16,17]. While many such algorithms, most notably binary splitting, may be very efficient in theory, they might be unsuitable because of practical limitations.…”
Section: Introductionmentioning
confidence: 99%
“…If a pool of n samples tests negative, all samples must be negative, and therefore their status has been determined in only one test instead of n individual tests. Various group testing algorithms exist, with different assumptions and constraints [16,17]. While many such algorithms, most notably binary splitting, may be very efficient in theory, they might be unsuitable because of practical limitations.…”
Section: Introductionmentioning
confidence: 99%
“…It should be acknowledged that this valuable boost does not explore the theoretical and practically achievable rates of compressive sampling capabilities. While theoretically perfect, reconstruction of original test results available with not much more than k log 2 (N/k) measurements (25), where N is the number of samples and k is the number of positive cases, with the use of modern decoding algorithms, the achievable rates are close to the theoretical bounds. This means a 10-to 20-fold rate increase for a 1-0.1% prevalence band is possible with more sophisticated pooling schemes and decoding algorithms.…”
Section: Population Level Scanning For Covid-19mentioning
confidence: 77%
“…As collecting blood samples and performing a single Wassermann test for each man appeared to be quite resource demanding in the circumstances of World War II, pooling blood samples and performing group tests was observed to be quite effective since the disease was relatively rare. Later on, group testing has become a popular topic in the information theory field, enabling orders of magnitude saving from the test numbers while being able to pinpoint sparse positives accurately (25). Similarly, the attractiveness of recovering sparse signals from a small number of measurements led, in the mid-2000s, to the birth of an entire research area called compressive sampling (compressed sensing) in the signal processing field around (26).…”
Section: Population Level Scanning For Covid-19mentioning
confidence: 99%
“…Thus, a few definitions may be useful here. A group test is noiseless if a negative test outcome is guaranteed when all items in the testing pool are nondefective, and a positive outcome when a least one item in the pool is defective (Aldridge, Johnson and Scarlett, 2019). Otherwise, the test is noisy.…”
Section: Using Homophily To Push Information-theoretic Limitsmentioning
confidence: 99%