Community aware group testing

07/16/2020
by   Pavlos Nikolopoulos, et al.
0

Group testing pools together diagnostic samples to reduce the number of tests needed to identify infected members in a population. The observation we make in this paper is that we can leverage a known community structure to make group testing more efficient. For example, if n population members are partitioned into F families, then in some cases we need a number of tests that increases (almost) linearly with k_f, the number of families that have at least one infected member, as opposed to k, the total number of infected members. We show that taking into account community structure allows to reduce the number of tests needed for adaptive and non-adaptive group testing, and can improve the reliability in the case where tests are noisy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2020

Group testing for overlapping communities

In this paper, we propose algorithms that leverage a known community str...
research
01/22/2020

Optimal Multistage Group Testing Algorithm for 3 Defectives

Group testing is a well-known search problem that consists in detecting ...
research
01/20/2019

A New Algorithm for Two-Stage Group Testing

Group testing is a well-known search problem that consists in detecting ...
research
06/20/2021

Dynamic group testing to control and monitor disease progression in a population

In the context of a pandemic like COVID-19, and until most people are va...
research
07/13/2020

Semi-steady-state Jaya Algorithm

The Jaya algorithm is arguably one of the fastest-emerging metaheuristic...
research
02/17/2022

Structure-aware combinatorial group testing: a new method for pandemic screening

Combinatorial group testing (CGT) is used to identify defective items fr...
research
02/10/2022

Group Testing on General Set-Systems

Group testing is one of the fundamental problems in coding theory and co...

Please sign up or login with your details

Forgot password? Click here to reset