A tractable non-adaptative group testing method for non-binary measurements

DOI10.1051/PS/2022007MaRDI QIDQ5093271zbMATH OpenOpenAlexFDO

Authors Emilien Joly, Bastien Mallein

Publication date 26 July 2022

Published in ESAIM: Probability and Statistics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2012.09096

zbMATH Keywords

group testingalgorithm design and analysisone-stage algorithmnon-adaptative group testingnon-binary test

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Fault detection; testing in circuits and networks (94C12)

Abstract: 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 all defective items of the collection with as few tests as possible. This problem is relevant in several fields, among which biology and computer sciences. In the present article we consider that the tests applied to groups of items returns a emph{load}, measuring how defective the most defective item of the group is. In this setting, we propose a simple non-adaptative algorithm allowing the detection of all defective items of the collection. This method improves on classical group testing algorithms using only the binary response of the test. Group testing recently gained attraction as a potential tool to solve a shortage of COVID-19 test kits, in particular for RT-qPCR. These tests return the viral load of the sample and the viral load varies greatly among individuals. Therefore our model presents some of the key features of this problem. We aim at using the extra piece of information that represents the viral load to construct a one-stage pool testing algorithm on this idealized version. We show that under the right conditions, the total number of tests needed to detect contaminated samples can be drastically diminished.

Recommendations

• Group testing: revisiting the ideas
• Optimal group testing
• Efficient group testing algorithms with a constrained number of positive responses
• Algorithms and Data Structures
• Group testing with random pools: Phase transitions and optimal strategy

Cites work

• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds
• Efficient Algorithms for Noisy Group Testing
• Group Testing With Random Pools: Optimal Two-Stage Algorithms
• Group testing to identify one defective and one mediocre item
• Group testing with random pools: Phase transitions and optimal strategy
• Group testing: an information theory perspective
• On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing
• Pooling, lattice square, and union jack designs
• Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing
• Static Risk-Based Group Testing Schemes Under Imperfectly Observable Risk

Cited in

(4)

• Rapid, large-scale, and effective detection of COVID-19 via non-adaptive testing
• Real-valued group testing for quantitative molecular assays
• Group testing: revisiting the ideas
• Optimizing Nonadaptive Group Tests for Objects with Heterogeneous Priors

This page was built for publication: A tractable non-adaptative group testing method for non-binary measurements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5093271)