Group testing

There are two independent classifications for group-testing problems; every group-testing problem is either adaptive or non-adaptive, and either probabilistic or combinatorial.[3]

In probabilistic models, the defective items are assumed to follow some probability distribution and the aim is to minimise the expected number of tests needed to identify the defectiveness of every item. On the other hand, with combinatorial group testing, the goal is to minimise the number of tests needed in a 'worst-case scenario' – that is, create a minmax algorithm – and no knowledge of the distribution of defectives is assumed.[3]

The other classification, adaptivity, concerns what information can be used when choosing which items to group into a test. In general, the choice of which items to test can depend on the results of previous tests, as in the above lightbulb problem. An algorithm that proceeds by performing a test, and then using the result (and all past results) to decide which next test to perform, is called adaptive. Conversely, in non-adaptive algorithms, all tests are decided in advance. This idea can be generalised to multistage algorithms, where tests are divided into stages, and every test in the next stage must be decided in advance, with only the knowledge of the results of tests in previous stages. Although adaptive algorithms offer much more freedom in design, it is known that adaptive group-testing algorithms do not improve upon non-adaptive ones by more than a constant factor in the number of tests required to identify the set of defective items.[4][3] In addition to this, non-adaptive methods are often useful in practice because one can proceed with successive tests without first analysing the results of all previous tests, allowing for the effective distribution of the testing process.

There are many ways to extend the problem of group testing. One of the most important is called noisy group testing, and deals with a big assumption of the original problem: that testing is error-free. A group-testing problem is called noisy when there is some chance that the result of a group test is erroneous (e.g. comes out positive when the test contained no defectives). The Bernoulli noise model assumes this probability is some constant, ${\displaystyle q}$, but in general it can depend on the true number of defectives in the test and the number of items tested.[5] For example, the effect of dilution can be modelled by saying a positive result is more likely when there are more defectives (or more defectives as a fraction of the number tested), present in the test.[6] A noisy algorithm will always have a non-zero probability of making an error (that is, mislabeling an item).

Group testing can be extended by considering scenarios in which there are more than two possible outcomes of a test. For example, a test may have the outcomes ${\displaystyle 0,1}$ and ${\displaystyle 2^{+}}$, corresponding to there being no defectives, a single defective, or an unknown number of defectives larger than one. More generally, it is possible to consider the outcome-set of a test to be ${\displaystyle {0,1,\ldots ,k^{+}}}$ for some ${\displaystyle k\in \mathbb {N} }$.[3]

Another extension is to consider geometric restrictions on which sets can be tested. The above lightbulb problem is an example of this kind of restriction: only bulbs that appear consecutively can be tested. Similarly, the items may be arranged in a circle, or in general, a net, where the tests are available paths on the graph. Another kind of geometric restriction would be on the maximum number of items that can be tested in a group,[lower-alpha 1] or the group sizes might have to be even and so on. In a similar way, it may be useful to consider the restriction that any given item can only appear in a certain number of tests.[3]

There are endless ways to continue remixing the basic formula of group testing. The following elaborations will give an idea of some of the more exotic variants. In the 'good–mediocre–bad' model, each item is one of 'good', 'mediocre' or 'bad', and the result of a test is the type of the 'worst' item in the group. In threshold group testing, the result of a test is positive if the number of defective items in the group is greater than some threshold value or proportion.[7] Group testing with inhibitors is a variant with applications in molecular biology. Here, there is a third class of items called inhibitors, and the result of a test is positive if it contains at least one defective and no inhibitors.[8]

The concept of group testing was first introduced by Robert Dorfman in 1943 in a short report[2] published in the Notes section of Annals of Mathematical Statistics.[3][lower-alpha 2] Dorfman's report – as with all the early work on group testing – focused on the probabilistic problem, and aimed to use the novel idea of group testing to reduce the expected number of tests needed to weed out all syphilitic men in a given pool of soldiers. The method was simple: put the soldiers into groups of a given size, and use individual testing (testing items in groups of size one) on the positive groups to find which were infected. Dorfman tabulated the optimum group sizes for this strategy against the prevalence rate of defectiveness in the population.[2] Stephen Samuels [10] found a closed-form solution for the optimal group size as a function of the prevalence rate.

After 1943, group testing remained largely untouched for a number of years. Then in 1957, Sterrett produced an improvement on Dorfman's procedure.[11] This newer process starts by again performing individual testing on the positive groups, but stopping as soon as a defective is identified. Then, the remaining items in the group are tested together, since it is very likely that none of them are defective.

The first thorough treatment of group testing was given by Sobel and Groll in their formative 1959 paper on the subject.[12] They described five new procedures – in addition to generalisations for when the prevalence rate is unknown – and for the optimal one, they provided an explicit formula for the expected number of tests it would use. The paper also made the connection between group testing and information theory for the first time, as well as discussing several generalisations of the group-testing problem and providing some new applications of the theory.

The fundamental result by Peter Ungar in 1960 shows that if the prevalence rate ${\displaystyle p>p_{u}=(3-{\sqrt {5}})/2\approx 0.38}$, then individual testing is the optimal group testing procedure with respect to the expected number of tests, and if ${\displaystyle p<p_{u}}$, then it is not optimal. However, it is important to note that despite 80 years' worth of research effort, the optimal procedure is yet unknown for ${\displaystyle p<p_{u}}$ and a general population size ${\displaystyle n>2}$.[13]

Group testing was first studied in the combinatorial context by Li in 1962,[14] with the introduction of Li’s ${\displaystyle s}$-stage algorithm.[3] Li proposed an extension of Dorfman's '2-stage algorithm' to an arbitrary number of stages that required no more than ${\displaystyle t={\frac {e}{\log _{2}(e)}}d\log _{2}(n)}$ tests to be guaranteed to find ${\displaystyle d}$ or fewer defectives among ${\displaystyle n}$ items. The idea was to remove all the items in negative tests, and divide the remaining items into groups as was done with the initial pool. This was to be done ${\displaystyle s-1}$ times before performing individual testing.

Combinatorial group testing in general was later studied more fully by Katona in 1973.[15] Katona introduced the matrix representation of non-adaptive group-testing and produced a procedure for finding the defective in the non-adaptive 1-defective case in no more than ${\displaystyle t=\lceil \log _{2}(n)\rceil }$tests, which he also proved to be optimal.

In general, finding optimal algorithms for adaptive combinatorial group testing is difficult, and although the computational complexity of group testing has not been determined, it is suspected to be hard in some complexity class.[3] However, an important breakthrough occurred in 1972, with the introduction of the generalised binary-splitting algorithm.[16] The generalised binary-splitting algorithm works by performing a binary search on groups that test positive, and is a simple algorithm that finds a single defective in no more than the information-lower-bound number of tests.

In scenarios where there are two or more defectives, the generalised binary-splitting algorithm still produces near-optimal results, requiring at most ${\displaystyle d-1}$ tests above the information lower bound where ${\displaystyle d}$ is the number of defectives.[16] Considerable improvements to this were made in 2013 by Allemann, getting the required number of tests to less than ${\displaystyle 0.187d+0.5\log _{2}(d)+5.5}$ above the information lower bound when ${\displaystyle n/d\geq 38}$ and ${\displaystyle d\geq 10}$.[17] This was achieved by changing the binary search in the binary-splitting algorithm to a complex set of sub-algorithms with overlapping test groups. As such, the problem of adaptive combinatorial group testing – with a known number or upper bound on the number of defectives – has essentially been solved, with little room for further improvement.

There is an open question as to when individual testing is minmax. Hu, Hwang and Wang showed in 1981 that individual testing is minmax when ${\displaystyle n\leq \lfloor (5d+1)/2\rfloor }$, and that it is not minmax when ${\displaystyle n>3d}$.[18] It is currently conjectured that this bound is sharp: that is, individual testing is minmax if and only if ${\displaystyle n\leq 3d}$.[19][lower-alpha 3] Some progress was made in 2000 by Riccio and Colbourn, who showed that for large ${\displaystyle n}$, individual testing is minmax when ${\displaystyle d\geq n/\log _{3/2}(3)\approx 0.369n}$.[20]

One of the key insights in non-adaptive group testing is that significant gains can be made by eliminating the requirement that the group-testing procedure be certain to succeed (the "combinatorial" problem), but rather permit it to have some low but non-zero probability of mis-labelling each item (the "probabilistic" problem). It is known that as the number of defective items approaches the total number of items, exact combinatorial solutions require significantly more tests than probabilistic solutions — even probabilistic solutions permitting only an asymptotically small probability of error.[4][lower-alpha 4]

In this vein, Chan et al. (2011) introduced COMP, a probabilistic algorithm that requires no more than ${\displaystyle t=ed(1+\delta )\ln(n)}$ tests to find up to ${\displaystyle d}$ defectives in ${\displaystyle n}$ items with a probability of error no more than ${\displaystyle n^{-\delta }}$.[5] This is within a constant factor of the ${\displaystyle t=O(d\log _{2}n)}$ lower bound.[4]

Chan et al. (2011) also provided a generalisation of COMP to a simple noisy model, and similarly produced an explicit performance bound, which was again only a constant (dependent on the likelihood of a failed test) above the corresponding lower bound.[4][5] In general, the number of tests required in the Bernoulli noise case is a constant factor larger than in the noiseless case.[5]

Aldridge, Baldassini and Johnson (2014) produced an extension of the COMP algorithm that added additional post-processing steps.[21] They showed that the performance of this new algorithm, called DD, strictly exceeds that of COMP, and that DD is 'essentially optimal' in scenarios where ${\displaystyle d^{2}\geq n}$, by comparing it to a hypothetical algorithm that defines a reasonable optimum. The performance of this hypothetical algorithm suggests that there is room for improvement when ${\displaystyle d^{2}<n}$, as well as suggesting how much improvement this might be.[21]

Since it is always possible to resort to individual testing by setting ${\displaystyle S_{j}=\{j\}}$ for each ${\displaystyle 1\leq j\leq n}$, it must be that that ${\displaystyle {\bar {t}}(d,n)\leq n}$. Also, since any non-adaptive testing procedure can be written as an adaptive algorithm by simply performing all the tests without regard to their outcome, ${\displaystyle t(d,n)\leq {\bar {t}}(d,n)}$. Finally, when ${\displaystyle 0\neq d\neq n}$, there is at least one item whose defectiveness must be determined (by at least one test), and so ${\displaystyle 1\leq t(d,n)}$.

In summary (when assuming ${\displaystyle 0\neq d\neq n}$), ${\displaystyle 1\leq t(d,n)\leq {\bar {t}}(d,n)\leq n}$.[lower-alpha 6]

A lower bound on the number of tests needed can be described using the notion of sample space, denoted ${\displaystyle {\mathcal {S}}}$, which is simply the set of possible placements of defectives. For any group testing problem with sample space ${\displaystyle {\mathcal {S}}}$ and any group-testing algorithm, it can be shown that ${\displaystyle t\geq \lceil \log _{2}{|{\mathcal {S}}|}\rceil }$, where ${\displaystyle t}$ is the minimum number of tests required to identify all defectives with a zero probability of error. This is called the information lower bound.[3] This bound is derived from the fact that after each test, ${\displaystyle {\mathcal {S}}}$ is split into two disjoint subsets, each corresponding to one of the two possible outcomes of the test.

However, the information lower bound itself is usually unachievable, even for small problems.[3] This is because the splitting of ${\displaystyle {\mathcal {S}}}$ is not arbitrary, since it must be realisable by some test.

In fact, the information lower bound can be generalised to the case where there is a non-zero probability that the algorithm makes an error. In this form, the theorem gives us an upper bound on the probability of success based on the number of tests. For any group-testing algorithm that performs ${\displaystyle t}$ tests, the probability of success, ${\displaystyle \mathbb {P} ({\textrm {success}})}$, satisfies ${\displaystyle \mathbb {P} ({\textrm {success}})\leq t/\log _{2}{n \choose d}}$. This can be strengthened to: ${\displaystyle \mathbb {P} ({\textrm {success}})\leq {\frac {2^{t}}{n \choose d}}}$.[5][22]

A typical group testing setup. A non-adaptive algorithm first chooses the matrix ${\displaystyle M}$, and is then given the vector y. The problem is then to find an estimate for x.

Algorithms for non-adaptive group testing consist of two distinct phases. First, it is decided how many tests to perform and which items to include in each test. In the second phase, often called the decoding step, the results of each group test are analysed to determine which items are likely to be defective. The first phase is usually encoded in a matrix as follows.[5]

• Suppose a non-adaptive group testing procedure for ${\displaystyle n}$ items consists of the tests ${\displaystyle S_{1},S_{2},\dots ,S_{t}}$ for some ${\displaystyle t\in \mathbb {N} _{\geq 0}}$. The testing matrix for this scheme is the ${\displaystyle t\times n}$ binary matrix, ${\displaystyle M}$, where ${\displaystyle (M)_{ij}=1}$ if and only if ${\displaystyle j\in S_{i}}$ (and is zero otherwise).

Thus each column of ${\displaystyle M}$ represents an item and each row represents a test, with a ${\displaystyle 1}$ in the ${\displaystyle (i,j){\textrm {-th}}}$ entry indicating that the ${\displaystyle i{\textrm {-th}}}$ test included the ${\displaystyle j{\textrm {-th}}}$ item and a ${\displaystyle 0}$ indicating otherwise.

As well as the vector ${\displaystyle \mathbf {x} }$ (of length ${\displaystyle n}$) that describes the unknown defective set, it is common to introduce the result vector, which describes the results of each test.

• Let ${\displaystyle t}$ be the number of tests performed by a non-adaptive algorithm. The result vector, ${\displaystyle \mathbf {y} =(y_{1},y_{2},\dots ,y_{t})}$, is a binary vector of length ${\displaystyle t}$ (that is, ${\displaystyle \mathbf {y} \in \{0,1\}^{t}}$) such that ${\displaystyle y_{i}=1}$ if and only if the result of the ${\displaystyle i{\textrm {-th}}}$ test was positive (i.e. contained at least one defective).[lower-alpha 7]

With these definitions, the non-adaptive problem can be reframed as follows: first a testing matrix is chosen, ${\displaystyle M}$, after which the vector ${\displaystyle \mathbf {y} }$ is returned. Then the problem is to analyse ${\displaystyle \mathbf {y} }$ to find some estimate for ${\displaystyle \mathbf {x} }$.

In the simplest noisy case, where there is a constant probability, ${\displaystyle q}$, that a group test will have an erroneous result, one considers a random binary vector, ${\displaystyle \mathbf {v} }$, where each entry has a probability ${\displaystyle q}$ of being ${\displaystyle 1}$, and is ${\displaystyle 0}$ otherwise. The vector that is returned is then ${\displaystyle {\hat {\mathbf {y} }}=\mathbf {y} +\mathbf {v} }$, with the usual addition on ${\displaystyle (\mathbb {Z} /2\mathbb {Z} )^{n}}$ (equivalently this is the element-wise XOR operation). A noisy algorithm must estimate ${\displaystyle \mathbf {x} }$ using ${\displaystyle {\hat {\mathbf {y} }}}$ (that is, without direct knowledge of ${\displaystyle \mathbf {y} }$).[5]

The matrix representation makes it possible to prove some bounds on non-adaptive group testing. The approach mirrors that of many deterministic designs, where ${\displaystyle d}$-separable matrices are considered, as defined below.[3]

• A binary matrix, ${\displaystyle M}$, is called ${\displaystyle d}$-separable if every Boolean sum (logical OR) of any ${\displaystyle d}$ of its columns is distinct. Additionally, the notation ${\displaystyle {\bar {d}}}$-separable indicates that every sum of any of up to ${\displaystyle d}$ of ${\displaystyle M}$'s columns is distinct. (This is not the same as ${\displaystyle M}$ being ${\displaystyle k}$-separable for every ${\displaystyle k\leq d}$.)

When ${\displaystyle M}$ is a testing matrix, the property of being ${\displaystyle d}$-separable (${\displaystyle {\bar {d}}}$-separable) is equivalent to being able to distinguish between (up to) ${\displaystyle d}$ defectives. However, it does not guarantee that this will be straightforward. A stronger property, called ${\displaystyle d}$-disjunctness does.

• A binary matrix, ${\displaystyle M}$ is called ${\displaystyle d}$-disjunct if the Boolean sum of any ${\displaystyle d}$ columns does not contain any other column. (In this context, a column A is said to contain a column B if for every index where B has a 1, A also has a 1.)

A useful property of ${\displaystyle d}$-disjunct testing matrices is that, with up to ${\displaystyle d}$ defectives, every non-defective item will appear in at least one test whose outcome is negative. This means there is a simple procedure for finding the defectives: just remove every item that appears in a negative test.

Using the properties of ${\displaystyle d}$-separable and ${\displaystyle d}$-disjunct matrices the following can be shown for the problem of identifying ${\displaystyle d}$ defectives among ${\displaystyle n}$ total items.[4]

1. The number of tests needed for an asymptotically small average probability of error scales as ${\displaystyle O(d\log _{2}n)}$.
2. The number of tests needed for an asymptotically small maximum probability of error scales as ${\displaystyle O(d^{2}\log _{2}n)}$.
3. The number of tests needed for a zero probability of error scales as ${\displaystyle O\left({\frac {d^{2}\log _{2}n}{\log _{2}d}}\right)}$.

An illustration of the COMP algorithm. COMP identifies item a as being defective and item b as being non-defective. However, it incorrectly labels c as a defective, since it is “hidden” by defective items in every test in which it appears.

Combinatorial Orthogonal Matching Pursuit, or COMP, is a simple non-adaptive group-testing algorithm that forms the basis for the more complicated algorithms that follow in this section.

First, each entry of the testing matrix is chosen i.i.d. to be ${\displaystyle 1}$ with probability ${\displaystyle 1/d}$ and ${\displaystyle 0}$ otherwise.

The decoding step proceeds column-wise (i.e. by item). If every test in which an item appears is positive, then the item is declared defective; otherwise the item is assumed to be non-defective. Or equivalently, if an item appears in any test whose outcome is negative, the item is declared non-defective; otherwise the item is assumed to be defective. An important property of this algorithm is that it never creates false negatives, though a false positive occurs when all locations with ones in the j-th column of ${\displaystyle M}$ (corresponding to a non-defective item j) are "hidden" by the ones of other columns corresponding to defective items.

The COMP algorithm requires no more than ${\displaystyle ed(1+\delta )\ln(n)}$ tests to have an error probability less than or equal to ${\displaystyle n^{-\delta }}$.[5] This is within a constant factor of the lower bound for the average probability of error above.

In the noisy case, one relaxes the requirement in the original COMP algorithm that the set of locations of ones in any column of ${\displaystyle M}$ corresponding to a positive item be entirely contained in the set of locations of ones in the result vector. Instead, one allows for a certain number of “mismatches” – this number of mismatches depends on both the number of ones in each column, and also the noise parameter, ${\displaystyle q}$. This noisy COMP algorithm requires no more than ${\displaystyle 4.36({\sqrt {\delta }}+{\sqrt {1+\delta }})^{2}(1-2q)^{-2}d\log _{2}{n}}$ tests to achieve an error probability at most ${\displaystyle n^{-\delta }}$.[5]

The definite defectives method (DD) is an extension of the COMP algorithm that attempts to remove any false positives. Performance guarantees for DD have been shown to strictly exceed those of COMP.[21]

The decoding step uses a useful property of the COMP algorithm: that every item that COMP declares non-defective is certainly non-defective (that is, there are no false negatives). It proceeds as follows.

1. First the COMP algorithm is run, and any non-defectives that it detects are removed. All remaining items are now "possibly defective".
2. Next the algorithm looks at all the positive tests. If an item appears as the only "possible defective" in a test, then it must be defective, so the algorithm declares it to be defective.
3. All other items are assumed to be non-defective. The justification for this last step comes from the assumption that the number of defectives is much smaller than the total number of items.

Note that steps 1 and 2 never make a mistake, so the algorithm can only make a mistake if it declares a defective item to be non-defective. Thus the DD algorithm can only create false negatives.

SCOMP (Sequential COMP) is an algorithm that makes use of the fact that DD makes no mistakes until the last step, where it is assumed that the remaining items are non-defective. Let the set of declared defectives be ${\displaystyle K}$. A positive test is called explained by ${\displaystyle K}$ if it contains at least one item in ${\displaystyle K}$. The key observation with SCOMP is that the set of defectives found by DD may not explain every positive test, and that every unexplained test must contain a hidden defective.

The algorithm proceeds as follows.

1. Carry out steps 1 and 2 of the DD algorithm to obtain ${\displaystyle K}$, an initial estimate for the set of defectives.
2. If ${\displaystyle K}$ explains every positive test, terminate the algorithm: ${\displaystyle K}$ is the final estimate for the set of defectives.
3. If there are any unexplained tests, find the "possible defective" that appears in the largest number of unexplained tests, and declare it to be defective (that is, add it to the set ${\displaystyle K}$). Go to step 2.

In simulations, SCOMP has been shown to perform close to optimally.[21]

A deterministic algorithm that is guaranteed to exactly identify up to ${\displaystyle d}$ positives is Polynomial Pools (PP). [24]. The algorithm is for the construction of the pooling matrix ${\displaystyle M}$, which can be straightforwardly used to decode the observations in ${\displaystyle y}$. Similar to COMP, a sample is decoded according to the relation: ${\displaystyle x_{i}=1~~{\text{ if }}~~M(:,i)~.*~y=M(:,i)}$, where ${\displaystyle .*}$ represents element wise multiplication and ${\displaystyle M(:,i)}$ is the ${\displaystyle i}$th column of ${\displaystyle M}$. Since the decoding step is not difficult, PP is specialized for generating ${\displaystyle M}$.

Design of a group with ${\displaystyle q^{c-1}=9}$ samples (blue) from a set of ${\displaystyle n=q^{c}=27}$ total samples using the Polynomial Pools Algorithm

A group/pool ${\displaystyle \ell }$ is generated using a polynomial relation that specifies the indices of the samples contained in each pool. A set of input parameters determines the algorithm. For a prime number ${\displaystyle p>1}$ and an integer ${\displaystyle n\geq 1}$ any prime power is defined by ${\displaystyle q=p^{n}}$. For a dimension paramter ${\displaystyle c\geq 2}$ the total number of samples is ${\displaystyle n=q^{c}}$ and the number of samples per pool is ${\displaystyle q^{c-1}}$. Further, the Finite field of order ${\displaystyle q}$ is denoted by ${\displaystyle \mathbb {F} _{q}}$ (i.e, the integers ${\displaystyle \{0,1,2,\ldots ,q-1\}}$ defined by special arithmetic operations that ensure that addition and multiplication in ${\displaystyle \mathbb {F} _{q}}$ remains in ${\displaystyle \mathbb {F} _{q}}$). The method arranges each sample in a grid and represents it by coordinates ${\displaystyle x=(u,v)}$. The coordinates are computed according to a polynomial relation using the integers ${\displaystyle 1\leq l\leq c-1}$, ${\displaystyle 0\leq u_{i_{l}}\leq q-1}$

${\displaystyle v~=~a^{c-1}~u_{i_{c-1}}+\cdots +a~u_{i_{1}}+b,\quad a,b,u_{i_{l}}\in \mathbb {F} _{q}.}$

The combination of looping through the ${\displaystyle u_{i_{l}}}$ values is represented by a set with ${\displaystyle q^{c-1}}$ elements of a sequence of ${\displaystyle d-1}$ integers, i.e., ${\displaystyle u_{i_{1}}\times \cdots \times u_{i_{c-1}}=\{(i_{1},\ldots ,i_{c-1})\}}$, where ${\displaystyle 0\leq i_{l}\leq q-1}$. Without loss of generality, the combination is such that ${\displaystyle i_{d-1}}$ cycles every ${\displaystyle q}$ times, ${\displaystyle i_{d-2}}$ cycles every ${\displaystyle q^{2}}$ times until ${\displaystyle i_{1}}$ cycles only once. Formulas that compute the sample indices, and thus the corresponding pools, for fixed ${\displaystyle a}$ and ${\displaystyle b}$, are given by

${\displaystyle {\begin{aligned}u_{i}&=\sum _{l=1}^{c-1}~q^{d-1-l}~i_{l}\\v_{u_{i}}&=\sum _{l=1}^{c-1}~a^{l}~i_{l}+b\quad ({\text{computed in }}\mathbb {F} _{q})\\x_{qu_{i}+v_{u_{i}}}&=(u_{i},v_{u_{i}})\end{aligned}}}$

The computations in ${\displaystyle \mathbb {F} _{q}}$ can be implemented with publicly available software libraries for finite fields, when ${\displaystyle q}$ is a prime power. When ${\displaystyle q}$ is a prime number then the computations in ${\displaystyle \mathbb {F} _{q}}$ simplify to modulus arithmetics, i.e, ${\displaystyle v_{u_{i}}=(\sum _{l=1}^{c-1}a^{l}i_{l}+b)~{\text{mod}}~q}$. An example of how to generate one pool ${\displaystyle \ell }$ when ${\displaystyle a=1,b=0,c=2}$ is displayed in the table below, while the corresponding selection of samples is shown in the figure above.

Computing one pool ${\displaystyle \ell }$ using PP with ${\displaystyle c=3}$, ${\displaystyle q=3}$, ${\displaystyle a=1}$, ${\displaystyle b=0}$

${\displaystyle i_{1}}$	${\displaystyle i_{2}}$	${\displaystyle u_{i}}$	${\displaystyle v_{u_{i}}}$	${\displaystyle qu_{i}+v_{u_{i}}}$	${\displaystyle \ell }$
${\displaystyle 0}$	${\displaystyle 0}$	${\displaystyle 0}$	${\displaystyle 0}$	${\displaystyle 0}$	${\displaystyle x_{0}}$
${\displaystyle 0}$	${\displaystyle 1}$	${\displaystyle 1}$	${\displaystyle 1}$	${\displaystyle 4}$	${\displaystyle x_{4}}$
${\displaystyle 0}$	${\displaystyle 2}$	${\displaystyle 2}$	${\displaystyle 2}$	${\displaystyle 8}$	${\displaystyle x_{8}}$
${\displaystyle 1}$	${\displaystyle 0}$	${\displaystyle 3}$	${\displaystyle 1}$	${\displaystyle 10}$	${\displaystyle x_{10}}$
${\displaystyle 1}$	${\displaystyle 1}$	${\displaystyle 4}$	${\displaystyle 2}$	${\displaystyle 14}$	${\displaystyle x_{14}}$
${\displaystyle 1}$	${\displaystyle 2}$	${\displaystyle 5}$	${\displaystyle 0}$	${\displaystyle 15}$	${\displaystyle x_{15}}$
${\displaystyle 2}$	${\displaystyle 0}$	${\displaystyle 6}$	${\displaystyle 2}$	${\displaystyle 20}$	${\displaystyle x_{20}}$
${\displaystyle 2}$	${\displaystyle 1}$	${\displaystyle 7}$	${\displaystyle 0}$	${\displaystyle 21}$	${\displaystyle x_{21}}$
${\displaystyle 2}$	${\displaystyle 2}$	${\displaystyle 8}$	${\displaystyle 1}$	${\displaystyle 25}$	${\displaystyle x_{25}}$

This method uses ${\displaystyle q(c-1)(d+1)}$ tests to exactly identify up to ${\displaystyle d}$ positives among ${\displaystyle n=q^{c}}$ samples. Because of this PP is particularly effective for large sample sizes, since the number of tests grows only linearly with respect to ${\displaystyle c}$ while the samples grow exponentially with this parameter. However PP can also be effective for small sample sizes.[24]

An illustration of a multiaccess channel showing a successful message and a message collision.

A multiaccess channel is a communication channel that connects many users at once. Every user can listen and transmit on the channel, but if more than one user transmits at the same time, the signals collide, and are reduced to unintelligible noise. Multiaccess channels are important for various real-world applications, notably wireless computer networks and phone networks.[30]

A prominent problem with multiaccess channels is how to assign transmission times to the users so that their messages do not collide. A simple method is to give each user their own time slot in which to transmit, requiring ${\displaystyle n}$ slots. (This is called time division multiplexing, or TDM.) However, this is very inefficient, since it will assign transmission slots to users that may not have a message, and it is usually assumed that only a few users will want to transmit at any given time – otherwise a multiaccess channel is not practical in the first place.

In the context of group testing, this problem is usually tackled by dividing time into 'epochs' in the following way.[3] A user is called 'active' if they have a message at the start of an epoch. (If a message is generated during an epoch, the user only becomes active at the start of the next one.) An epoch ends when every active user has successfully transmitted their message. The problem is then to find all the active users in a given epoch, and schedule a time for them to transmit (if they have not already done so successfully). Here, a test on a set of users corresponds to those users attempting a transmission. The results of the test are the number of users that attempted to transmit, ${\displaystyle 0,1,}$ and ${\displaystyle 2^{+}}$, corresponding respectively to no active users, exactly one active user (message successful) or more than one active user (message collision). Therefore, using an adaptive group testing algorithm with outcomes ${\displaystyle \{0,1,2^{+}\}}$, it can be determined which users wish to transmit in the epoch. Then, any user that has not yet made a successful transmission can now be assigned a slot to transmit, without wastefully assigning times to inactive users.

Machine learning is a field of computer science that has many software applications such as DNA classification, fraud detection and targeted advertising. One of the main subfields of machine learning is the 'learning by examples' problem, where the task is to approximate some unknown function when given its value at a number of specific points.[3] As outlined in this section, this function learning problem can be tackled with a group-testing approach.

In a simple version of the problem, there is some unknown function, ${\displaystyle f:\{0,1\}^{N}\to \{0,1\}}$ where ${\displaystyle f({\textbf {x}})={\textbf {a}}\cdot {\textbf {x}}}$, and ${\displaystyle {\textbf {a}}\in \{0,1\}^{N}}$ (using logical arithmetic: addition is logical OR and multiplication is logical AND). Here ${\displaystyle {\textbf {a}}}$ is '${\displaystyle d}$ sparse', which means that at most ${\displaystyle d\ll N}$ of its entries are ${\displaystyle 1}$. The aim is to construct an approximation to ${\displaystyle f}$ using ${\displaystyle t}$ point evaluations, where ${\displaystyle t}$ is as small as possible.[4] (Exactly recovering ${\displaystyle f}$ corresponds to zero-error algorithms, whereas ${\displaystyle f}$ is approximated by algorithms that have a non-zero probability of error.)

In this problem, recovering ${\displaystyle f}$ is equivalent to finding ${\displaystyle {\textbf {a}}}$. Moreover, ${\displaystyle f({\textbf {p}})=1}$ if and only if there is some index, ${\displaystyle n}$, where ${\displaystyle {\textbf {a}}_{n}={\textbf {p}}_{n}=1}$. Thus this problem is analogous to a group-testing problem with ${\displaystyle d}$ defectives and ${\displaystyle n}$ total items. The entries of ${\displaystyle {\textbf {a}}}$ are the items, which are defective if they are ${\displaystyle 1}$, ${\displaystyle {\textbf {p}}}$ specifies a test, and a test is positive if and only if ${\displaystyle f({\textbf {p}})=1}$.[4]

In reality, one will often be interested in functions that are more complicated, such as ${\displaystyle f:\mathbb {C} ^{N}\to \mathbb {C} }$, again where ${\displaystyle f({\textbf {x}})={\textbf {a}}\cdot {\textbf {x}}}$. Compressed sensing, which is closely related to group testing, can be used to solve this problem.[4]

In compressed sensing, the goal is to reconstruct a signal, ${\displaystyle {\textbf {v}}\in \mathbb {C} ^{N}}$, by taking a number of measurements. These measurements are modelled as taking the dot product of ${\displaystyle {\textbf {v}}}$ with a chosen vector.[lower-alpha 8] The aim is to use a small number of measurements, though this is typically not possible unless something is assumed about the signal. One such assumption (which is common[33][34]) is that only a small number of entries of ${\displaystyle {\textbf {v}}}$ are significant, meaning that they have a large magnitude. Since the measurements are dot products of ${\displaystyle {\textbf {v}}}$, the equation ${\displaystyle M{\textbf {v}}={\textbf {q}}}$ holds, where ${\displaystyle M}$ is a ${\displaystyle t\times N}$ matrix that describes the set of measurements that have been chosen and ${\displaystyle \mathbf {q} }$ is the set of measurement results. This construction shows that compressed sensing is a kind of 'continuous' group testing.

The primary difficulty in compressed sensing is identifying which entries are significant.[33] Once that is done, there are a variety of methods to estimate the actual values of the entries.[35] This task of identification can be approached with a simple application of group testing. Here a group test produces a complex number: the sum of the entries that are tested. The outcome of a test is called positive if it produces a complex number with a large magnitude, which, given the assumption that the significant entries are sparse, indicates that at least one significant entry is contained in the test.

There are explicit deterministic constructions for this type of combinatorial search algorithm, requiring ${\displaystyle d2^{(\log _{2}\log _{2}N)^{O(1)}}}$ measurements.[36] However, as with group-testing, these are sub-optimal, and random constructions (such as COMP) can often recover ${\displaystyle f}$ sub-linearly in ${\displaystyle N}$.[35]

During a pandemic such as the COVID-19 outbreak in 2020, virus detection assays are sometimes run using nonadaptive group testing designs.[37][38] [39] One example was provided by the Origami Assays project which released open source group testing designs to run on a laboratory standard 96 well plate.[40]

Origami Assay paper template for group testing design

In a laboratory setting, one challenge of group testing is the construction of the mixtures can be time-consuming and difficult to do accurately by hand. Origami assays provided a workaround for this construction problem by providing paper templates to guide the technician on how to allocate patient samples across the test wells.[41]

Using the largest group testing designs (XL3) it was possible to test 1120 patient samples in 94 assay wells. If the true positive rate was low enough, then no additional testing was required.

Data forensics is a field dedicated to finding methods for compiling digital evidence of a crime. Such crimes typically involve an adversary modifying the data, documents or databases of a victim, with examples including the altering of tax records, a virus hiding its presence, or an identity thief modifying personal data.[29]

A common tool in data forensics is the one-way cryptographic hash. This is a function that takes the data, and through a difficult-to-reverse procedure, produces a unique number called a hash.[lower-alpha 9] Hashes, which are often much shorter than the data, allow us to check if the data has been changed without having to wastefully store complete copies of the information: the hash for the current data can be compared with a past hash to determine if any changes have occurred. An unfortunate property of this method is that, although it is easy to tell if the data has been modified, there is no way of determining how: that is, it is impossible to recover which part of the data has changed.[29]

One way to get around this limitation is to store more hashes – now of subsets of the data structure – to narrow down where the attack has occurred. However, to find the exact location of the attack with a naive approach, a hash would need to be stored for every datum in the structure, which would defeat the point of the hashes in the first place. (One may as well store a regular copy of the data.) Group testing can be used to dramatically reduce the number of hashes that need to be stored. A test becomes a comparison between the stored and current hashes, which is positive when there is a mismatch. This indicates that at least one edited datum (which is taken as defectiveness in this model) is contained in the group that generated the current hash.[29]

In fact, the amount of hashes needed is so low that they, along with the testing matrix they refer to, can even be stored within the organisational structure of the data itself. This means that as far as memory is concerned the test can be performed 'for free'. (This is true with the exception of a master-key/password that is used to secretly determine the hashing function.)[29]

• Ding-Zhu, Du; Hwang, Frank K. (1993). Combinatorial group testing and its applications. Singapore: World Scientific. ISBN 978-9810212933.
• Atri Rudra's course on Error Correcting Codes: Combinatorics, Algorithms, and Applications (Spring 2007), Lectures 7.
• Atri Rudra's course on Error Correcting Codes: Combinatorics, Algorithms, and Applications (Spring 2010), Lectures 10, 11, 28, 29
• Du, D.; Hwang, F. (2006). Pooling Designs and Nonadaptive Group Testing. World Scientific. ISBN 9789814477864.
• Aldridge, M.; Johnson, O.; Scarlett, J. (2019). "Group Testing: An Information Theory Perspective" (PDF). Foundations and Trends in Communications and Information Theory. 15 (3–4): 196–392. doi:10.1561/0100000099. S2CID 62841593.
• Porat, E.; Rothschild, A. (2011). "Explicit nonadaptive combinatorial group testing schemes". IEEE Transactions on Information Theory. 57 (12): 7982–89. arXiv:0712.3876. doi:10.1109/TIT.2011.2163296. S2CID 8815474.
• Kagan, Eugene; Ben-gal, Irad (2014), "A group testing algorithm with online informational learning", IIE Transactions, 46 (2): 164–184, doi:10.1080/0740817X.2013.803639, ISSN 0740-817X, S2CID 18588494