English
Related papers

Related papers: Group Testing with Probabilistic Tests: Theory, De…

200 papers

In probabilistic nonadaptive group testing (PGT), we aim to characterize the number of pooled tests necessary to identify a random $k$-sparse vector of defectives with high probability. Recent work has shown that $n$ tests are necessary…

Information Theory · Computer Science 2021-06-15 Larkin Flodin , Arya Mazumdar

We study Probabilistic Group Testing of a set of N items each of which is defective with probability p. We focus on the double limit of small defect probability, p<<1, and large number of variables, N>>1, taking either p->0 after…

Data Structures and Algorithms · Computer Science 2007-11-14 Marc Mezard , Cristina Toninelli

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

The task of non-adaptive group testing is to identify up to $d$ defective items from $N$ items, where a test is positive if it contains at least one defective item, and negative otherwise. If there are $t$ tests, they can be represented as…

Information Theory · Computer Science 2020-01-07 Thach V. Bui , Minoru Kuribayashi , Tetsuya Kojima , Roghayyeh Haghvirdinezhad , Isao Echizen

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…

Information Theory · Computer Science 2021-08-24 Thach V. Bui , Mahdi Cheraghchi , Isao Echizen

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

Large scale disease screening is a complicated process in which high costs must be balanced against pressing public health needs. When the goal is screening for infectious disease, one approach is group testing in which samples are…

Applications · Statistics 2021-03-02 Gregory Haber , Yaakov Malinovsky , Paul S. Albert

In this paper, we derive mutual information based upper and lower bounds on the number of nonadaptive group tests required to identify a given number of "non defective" items from a large population containing a small number of "defective"…

Information Theory · Computer Science 2016-03-01 Abhay Sharma , Chandra R. Murthy

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

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

The goal of non-adaptive group testing is to identify at most $d$ defective items from $N$ items, in which a test of a subset of $N$ items is positive if it contains at least one defective item, and negative otherwise. However, in many…

Information Theory · Computer Science 2018-03-19 Thach V. Bui , Tetsuya Kojima , Minoru Kuribayashi , Isao Echizen

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…

Information Theory · Computer Science 2020-09-08 Nader H. Bshouty , Catherine A. Haddad-Zaknoon

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…

Information Theory · Computer Science 2013-01-31 Matthew Aldridge

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 study the problem of determining exactly the number of defective items in an adaptive Group testing by using a minimum number of tests. We improve the existing algorithm and prove a lower bound that shows that the number of tests in our…

Information Theory · Computer Science 2020-01-03 Nader H. Bshouty , Catherine A. Haddad-Zaknoon , Raghd Boulos , Foad Moalem , Jalal Nada , Elias Noufi , Yara Zaknoon

In the group testing problem, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical…

Information Theory · Computer Science 2022-09-28 Nelvin Tan , Way Tan , Jonathan Scarlett

In identifying infected patients in a population, group testing is an effective method to reduce the number of tests and correct the test errors. In the group testing procedure, tests are performed on pools of specimens collected from…

Machine Learning · Statistics 2021-02-10 Ayaka Sakata

We study the group test for DNA library screening based on probabilistic approach. Group test is a method of detecting a few positive items from among a large number of items, and has wide range of applications. In DNA library screening,…

Computation · Statistics 2010-04-27 Takafumi Kanamori , Hiroaki Uehara , Masakazu Jimbo

We consider the probabilistic group testing problem where $d$ random defective items in a large population of $N$ items are identified with high probability by applying binary tests. It is known that $\Theta(d \log N)$ tests are necessary…

Information Theory · Computer Science 2019-02-27 Huseyin A. Inan , Peter Kairouz , Mary Wootters , Ayfer Ozgur

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