English
Related papers

Related papers: A tractable non-adaptative group testing method fo…

200 papers

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…

Discrete Mathematics · Computer Science 2020-10-20 Laurence A. Clarfeld , Margaret J. Eppstein

We explore the problem of deriving a posteriori probabilities of being defective for the members of a population in the non-adaptive group testing framework. Both noiseless and noisy testing models are addressed. The technique, which relies…

Information Theory · Computer Science 2021-02-11 Gianluigi Liva , Enrico Paolini , Marco Chiani

We study the problem usually referred to as group testing in the context of COVID-19. Given $n$ samples taken from patients, how should we select mixtures of samples to be tested, so as to maximize information and minimize the number of…

Methodology · Statistics 2020-05-14 Louis Abraham , Gary Bécigneul , Bernhard Schölkopf

Group testing with inhibitors (GTI) introduced by Farach at al. is studied in this paper. There are three types of items, $d$ defectives, $r$ inhibitors and $n-d-r$ normal items in a population of $n$ items. The presence of any inhibitor in…

Information Theory · Computer Science 2014-12-16 Abhinav Ganesan , Javad Ebrahimi , Sidharth Jaggi , Venkatesh Saligrama

We study the group testing problem with non-adaptive randomized algorithms. Several models have been discussed in the literature to determine how to randomly choose the tests. For a model ${\cal M}$, let $m_{\cal M}(n,d)$ be the minimum…

Machine Learning · Computer Science 2019-11-06 Nader H. Bshouty , George Haddad , Catherine A. Haddad-Zaknoon

In group testing, the task is to determine the distinguished members of a set of objects L by asking subset queries of the form ``does the subset Q of L contain a distinguished object?'' The primary biological application of group testing…

Combinatorics · Mathematics 2008-02-03 Emanuel Knill , S. Muthukrishnan

In this paper, combinatorial quantitative group testing (QGT) with noisy measurements is studied. The goal of QGT is to detect defective items from a data set of size $n$ with counting measurements, each of which counts the number of…

Information Theory · Computer Science 2022-02-01 Yun-Han Li , I-Hsiang Wang

Identification of up to $d$ defective items and up to $h$ inhibitors in a set of $n$ items is the main task of non-adaptive group testing with inhibitors. To efficiently reduce the cost of this Herculean task, a subset of the $n$ items is…

Information Theory · Computer Science 2019-01-10 Thach V. Bui , Minoru Kuribayashi , Tetsuya Kojima , Isao Echizen

Accurate detection of infected individuals is one of the critical steps in stopping any pandemic. When the underlying infection rate of the disease is low, testing people in groups, instead of testing each individual in the population, can…

In this paper, we consider the problem of noiseless non-adaptive probabilistic group testing, in which the goal is high-probability recovery of the defective set. We show that in the case of $n$ items among which $k$ are defective, the…

Information Theory · Computer Science 2021-07-30 Wei Heng Bay , Eric Price , Jonathan Scarlett

We consider the nonadaptive group testing with N items, of which $K = \Theta(N^\theta)$ are defective. We study a test design in which each item appears in nearly the same number of tests. For each item, we independently pick L tests…

Information Theory · Computer Science 2018-09-26 Oliver Johnson , Matthew Aldridge , Jonathan Scarlett

Group testing is a long studied problem in combinatorics: A small set of $r$ ill people should be identified out of the whole ($n$ people) by using only queries (tests) of the form "Does set X contain an ill human?". In this paper we…

Data Structures and Algorithms · Computer Science 2008-04-29 Ely Porat , Amir Rothschild

Consider a collection of objects, some of which may be `bad', and a test which determines whether or not a given sub-collection contains no bad objects. The non-adaptive pooling (or group testing) problem involves identifying the bad…

Combinatorics · Mathematics 2016-09-06 David J. Balding , David C. Torney

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…

Information Theory · Computer Science 2017-11-16 Matthew Aldridge

In this paper, we consider the group testing problem with adaptive test designs and noisy outcomes. We propose a computationally efficient four-stage procedure with components including random binning, identification of bins containing…

Computation · Statistics 2019-11-11 Jonathan Scarlett

Given $p$ samples, each of which may or may not be defective, group testing (GT) aims to determine their defect status by performing tests on $n < p$ `groups', where a group is formed by mixing a subset of the $p$ samples. Assuming that the…

Machine Learning · Statistics 2025-07-25 Shuvayan Banerjee , Radhendushka Srivastava , James Saunderson , Ajit Rajwade

Group testing is one of the fundamental problems in coding theory and combinatorics in which one is to identify a subset of contaminated items from a given ground set. There has been renewed interest in group testing recently due to its…

Information Theory · Computer Science 2022-02-11 Mira Gonen , Michael Langberg , Alex Sprintson

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…

Applications · Statistics 2020-12-04 Christoph Schumacher , Matthias Täufer

This work focuses on non-adaptive combinatorial group testing, with a primary goal of efficiently identifying a set of at most $d$ defective elements among a given set of $n$ elements using the fewest possible tests. Non-adaptive…

Information Theory · Computer Science 2026-04-28 Daniil Goshkoder , Nikita Polyanskii , Ilya Vorobyev

Given $d$ defective items in a population of $n$ items with $d \ll n$, in threshold group testing without gap, the outcome of a test on a subset of items is positive if the subset has at least $u$ defective items and negative otherwise,…

Information Theory · Computer Science 2024-05-10 Thach V. Bui , Yeow Meng Chee , Van Khu Vu
‹ Prev 1 3 4 5 6 7 10 Next ›