Related papers: Small error algorithms for tropical group testing
In one-stage or non-adaptive group testing, instead of testing every sample unit individually, they are split, bundled in pools, and simultaneously tested. The results are then decoded to infer the states of the individual items. This…
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that…
We introduce a novel probabilistic group testing framework, termed Poisson group testing, in which the number of defectives follows a right-truncated Poisson distribution. The Poisson model has a number of new applications, including…
We consider nonadaptive group testing with Bernoulli tests, where each item is placed in each test independently with some fixed probability. We give a tight threshold on the maximum number of tests required to find the defective set under…
In this paper, we propose algorithms that leverage a known community structure to make group testing more efficient. We consider a population organized in connected communities: each individual participates in one or more communities, and…
We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noiseless, and the case when the measurements are…
In the group testing problem the aim is to identify a small set of $k\sim n^\theta$ infected individuals out of a population size $n$, $0<\theta<1$. We avail ourselves of a test procedure capable of testing groups of individuals, with the…
In the classical combinatorial (adaptive) group testing problem, one is given two integers \(d\) and \(n\), where \(0\le d\le n\), and a population of \(n\) items, exactly \(d\) of which are known to be defective. The question is to devise…
Group testing is a well-known search problem that consists in detecting of $s$ defective members of a set of $t$ samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all…
The problem of Group Testing is to identify defective items out of a set of objects by means of pool queries of the form "Does the pool contain at least a defective?". The aim is of course to perform detection with the fewest possible…
Group testing can save testing resources in the context of the ongoing COVID-19 pandemic. In group testing, we are given $n$ samples, one per individual, and arrange them into $m < n$ pooled samples, where each pool is obtained by mixing a…
Group testing is the combinatorial problem of identifying the defective items in a population by grouping items into test pools. Recently, nonadaptive group testing - where all the test pools must be decided on at the start - has been…
The basic goal of threshold group testing is to identify up to $d$ defective items among a population of $n$ items, where $d$ is usually much smaller than $n$. The outcome of a test on a subset of items is positive if the subset has at…
The corona virus disease 2019 (COVID-19) caused by the novel corona virus has an exponential rate of infection. COVID-19 is particularly notorious as the onset of symptoms in infected patients are usually delayed and there exists a large…
The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and is relevant in applications such as medical testing, communication protocols, pattern…
We study the problem of estimating the number of defective items $d$ within a pile of $n$ elements up to a multiplicative factor of $\Delta>1$, using deterministic group testing algorithms. We bring lower and upper bounds on the number of…
We consider the problem of identifying the defectives from a population of items via a non-adaptive group testing framework with a random pooling-matrix design. We analyze the sufficient number of tests needed for approximate set…
In the group-testing literature, efficient algorithms have been developed to minimize the number of tests required to identify all minimal "defective" sub-groups embedded within a larger group, using deterministic group splitting with a…
We consider a new group testing model wherein each item is a binary random variable defined by an a priori probability of being defective. We assume that each probability is small and that items are independent, but not necessarily…
Group testing concerns itself with the accurate recovery of a set of "defective" items from a larger population via a series of tests. While most works in this area have considered the classical group testing model, where tests are binary…