English
Related papers

Related papers: Efficient designs for threshold group testing with…

200 papers

Group-testing refers to the problem of identifying (with high probability) a (small) subset of $D$ defectives from a (large) set of $N$ items via a "small" number of "pooled" tests. For ease of presentation in this work we focus on the…

Information Theory · Computer Science 2013-07-11 Sheng Cai , Mohammad Jahangoshahi , Mayank Bakshi , Sidharth Jaggi

Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the given set O. In classical group testing the goal is to find…

Data Structures and Algorithms · Computer Science 2016-06-13 Annalisa De Bonis

This paper considers the problem of Quantitative Group Testing (QGT) where there are some defective items among a large population of $N$ items. We consider the scenario in which each item is defective with probability $K/N$, independently…

Information Theory · Computer Science 2019-10-16 Esmaeil Karimi , Fatemeh Kazemi , Anoosheh Heidarzadeh , Krishna R. Narayanan , Alex Sprintson

In the long-studied problem of combinatorial group testing, one is asked to detect a set of $k$ defective items out of a population of size $n$, using $m \ll n$ disjunctive measurements. In the non-adaptive setting, the most widely used…

Information Theory · Computer Science 2020-09-28 Mahdi Cheraghchi , Vasileios Nakos

We consider an efficiently decodable non-adaptive group testing (NAGT) problem that meets theoretical bounds. The problem is to find a few specific items (at most $d$) satisfying certain characteristics in a colossal number of $N$ items as…

Information Theory · Computer Science 2017-11-20 Thach V. Bui , Minoru Kuribayashi , Isao Echizen

In the problem of classical group testing one aims to identify a small subset (of size $d$) diseased individuals/defective items in a large population (of size $n$). This process is based on a minimal number of suitably-designed group tests…

Information Theory · Computer Science 2022-09-26 Xiwei Cheng , Sidharth Jaggi , Qiaoqiao Zhou

Non-adaptive group testing involves grouping arbitrary subsets of $n$ items into different pools. Each pool is then tested and defective items are identified. A fundamental question involves minimizing the number of pools required to…

Discrete Mathematics · Computer Science 2011-07-26 Mahdi Cheraghchi , Amin Karbasi , Soheil Mohajer , Venkatesh Saligrama

In this paper, we study the problem of non-adaptive group testing, in which one seeks to identify which items are defective given a set of suitably-designed tests whose outcomes indicate whether or not at least one defective item was…

Information Theory · Computer Science 2025-09-26 Lan V. Truong , Matthew Aldridge , Jonathan Scarlett

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

Efficiently counting or detecting defective items is a crucial task in various fields ranging from biological testing to quality control to streaming algorithms. The \emph{group testing estimation problem} concerns estimating the number of…

Data Structures and Algorithms · Computer Science 2023-12-08 Nader H. Bshouty , Tsun-Ming Cheung , Gergely Harcos , Hamed Hatami , Anthony Ostuni

The group testing problem consists of determining a small set of defective items from a larger set of items based on tests on groups of items, and is relevant in applications such as medical testing, communication protocols, pattern…

Information Theory · Computer Science 2020-01-27 Steffen Bondorf , Binbin Chen , Jonathan Scarlett , Haifeng Yu , Yuda Zhao

Group testing enables the identification of a small subset of defective items within a larger population by performing tests on pools of items rather than on each item individually. Over the years, it has not only attracted attention from…

Information Theory · Computer Science 2026-01-13 Manuel Franco-Vivo

Union-free codes and disjunctive codes are two combinatorial structures, which are used in nonadaptive group testing to find a set of $d$ defective elements among $n$ samples by carrying out the minimal number of tests $t$. It is known that…

Information Theory · Computer Science 2022-01-13 Ilya Vorobyev

In group testing, the task is to identify defective items by testing groups of them together using as few tests as possible. We consider the setting where each item is defective with a constant probability $\alpha$, independent of all other…

Discrete Mathematics · Computer Science 2024-11-15 Lukas Hintze , Lena Krieg , Olga Scheftelowitsch , Haodong Zhu

The original problem of group testing consists in the identification of defective items in a collection, by applying tests on groups of items that detect the presence of at least one defective item in the group. The aim is then to identify…

Applications · Statistics 2021-06-10 Emilien Joly , Bastien Mallein

In group testing, simple binary-output tests are designed to identify a small number $t$ of defective items that are present in a large population of $N$ items. Each test takes as input a group of items and produces a binary output…

Information Theory · Computer Science 2017-04-11 Alexander Barg , Arya Mazumdar

In this paper, we introduce a variation of the group testing problem capturing the idea that a positive test requires a combination of multiple ``types'' of item. Specifically, we assume that there are multiple disjoint \emph{semi-defective…

Information Theory · Computer Science 2024-05-10 Thach V. Bui , Jonathan Scarlett

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…

Information Theory · Computer Science 2023-09-19 Jonathan Scarlett , Oliver Johnson

The goal of combinatorial group testing is to efficiently identify up to $d$ defective items in a large population of $n$ items, where $d \ll n$. Defective items satisfy certain properties while the remaining items in the population do not.…

Information Theory · Computer Science 2019-04-02 Thach V. Bui , Minoru Kuribayashi , Mahdi Cheraghchi , Isao Echizen

We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independently from $\{0,1\}$ with a fixed probability $p$. The…

Machine Learning · Computer Science 2017-08-10 Nader H. Bshouty , Nuha Diab , Shada R. Kawar , Robert J. Shahla