Rates of adaptive group testing in the linear regime

01/22/2019
by   Matthew Aldridge, et al.
0

We consider adaptive group testing in the linear regime, where the number of defective items scales linearly with the number of items. We analyse an algorithm based on generalized binary splitting. Provided fewer than half the items are defective, we achieve rates of over 0.9 bits per test for combinatorial zero-error testing, and over 0.95 bits per test for probabilistic small-error testing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/25/2018

Individual testing is optimal for nonadaptive group testing in the linear regime

We consider nonadaptive probabilistic group testing in the linear regime...
research
02/06/2021

Nested Group Testing Procedures for Screening

This article reviews a class of adaptive group testing procedures that o...
research
09/13/2023

Small error algorithms for tropical group testing

We consider a version of the classical group testing problem motivated b...
research
05/18/2023

Balancing Test Accuracy and Security in Computerized Adaptive Testing

Computerized adaptive testing (CAT) is a form of personalized testing th...
research
06/23/2021

Noisy Adaptive Group Testing via Noisy Binary Search

The group testing problem consists of determining a small set of defecti...
research
06/18/2020

A Fast Binary Splitting Approach to Non-Adaptive Group Testing

In this paper, we consider the problem of noiseless non-adaptive group t...
research
01/29/2021

Combinatorial Quantitative Group Testing with Adversarially Perturbed Measurements

In this paper, combinatorial quantitative group testing (QGT) with noisy...

Please sign up or login with your details

Forgot password? Click here to reset