English
Related papers

Related papers: Novel Impossibility Results for Group-Testing

200 papers

Group testing is an approach aimed at identifying up to $d$ defective items among a total of $n$ elements. This is accomplished by examining subsets to determine if at least one defective item is present. In our study, we focus on the…

Data Structures and Algorithms · Computer Science 2023-07-12 Nader H. Bshouty , Catherine A. Haddad-Zaknoon

Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the sublinear regime $k = n^{\theta}$ (with $\theta \in (0,1)$), with…

Data Structures and Algorithms · Computer Science 2021-12-24 Oliver Gebhard , Max Hahn-Klimroth , Olaf Parczyk , Manuel Penschuck , Maurice Rolvien , Jonathan Scarlett , Nelvin Tan

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

Let $X$ be a set of items of size $n$ that contains some defective items, denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The outcome of a test is $1$ if $Q$ contains at least…

Data Structures and Algorithms · Computer Science 2023-08-16 Nader H. Bshouty

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

Let $X$ be a set of items of size $n$ , which may contain some defective items denoted by $I$, where $I \subseteq X$. In group testing, a {\it test} refers to a subset of items $Q \subset X$. The test outcome is $1$ (positive) if $Q$…

Data Structures and Algorithms · Computer Science 2023-09-19 Nader H. Bshouty , Gergely Harcos

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…

Information Theory · Computer Science 2011-07-25 Chun Lam Chan , Pak Hou Che , Sidharth Jaggi , Venkatesh Saligrama

Group testing is concerned with identifying $t$ defective items in a set of $m$ items, where each test reports whether a specific subset of items contains at least one defective. In non-adaptive group testing, the subsets to be tested are…

Computational Geometry · Computer Science 2020-12-03 Benjamin Aram Berendsohn , László Kozma

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

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

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

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

\emph{Group Testing} (GT) addresses the problem of identifying a small subset of defective items from a large population, by grouping items into as few test pools as possible. In \emph{Adaptive GT} (AGT), outcomes of previous tests can…

Information Theory · Computer Science 2020-08-17 Alejandro Cohen , Asaf Cohen , Omer Gurewitz

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 2018-10-05 Jonathan Scarlett

Non-adaptive group testing refers to the problem of inferring a sparse set of defectives from a larger population using the minimum number of simultaneous pooled tests. Recent positive results for noiseless group testing have motivated the…

Information Theory · Computer Science 2021-07-16 Gabriel Arpino , Nicolò Grometto , Afonso S. Bandeira

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 combinatorial group testing (CGT), the objective is to identify the set of at most $d$ defective items from a pool of $n$ items using as few tests as possible. The celebrated result for the CGT problem is that the number of tests $t$ can…

Information Theory · Computer Science 2019-01-29 Huseyin A. Inan , Peter Kairouz , Ayfer Ozgur

The principal goal of Group Testing (GT) is to identify a small subset of "defective" items from a large population, by grouping items into as few test pools as possible. The test outcome of a pool is positive if it contains at least one…

Information Theory · Computer Science 2020-08-13 Alejandro Cohen , Asaf Cohen , Omer Gurewitz

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

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
‹ Prev 1 2 3 10 Next ›