Optimal Pooling Matrix Design for Group Testing with Dilution (Row Degree) Constraints

08/05/2020
by   Jirong Yi, et al.
0

In this paper, we consider the problem of designing optimal pooling matrix for group testing (for example, for COVID-19 virus testing) with the constraint that no more than r>0 samples can be pooled together, which we call "dilution constraint". This problem translates to designing a matrix with elements being either 0 or 1 that has no more than r '1's in each row and has a certain performance guarantee of identifying anomalous elements. We explicitly give pooling matrix designs that satisfy the dilution constraint and have performance guarantees of identifying anomalous elements, and prove their optimality in saving the largest number of tests, namely showing that the designed matrices have the largest width-to-height ratio among all constraint-satisfying 0-1 matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2020

Comparisons of Pooling Matrices for Pooled Testing of COVID-19

In comparison with individual testing, group testing (also known as pool...
research
03/05/2023

Properties of Position Matrices and Their Elections

We study the properties of elections that have a given position matrix (...
research
01/24/2022

What is the cost of adding a constraint in linear least squares?

Although the theory of constrained least squares (CLS) estimation is wel...
research
03/10/2018

Optimum Linear Codes with Support Constraints over Small Fields

We consider the problem of designing optimal linear codes (in terms of h...
research
07/15/2019

A row-invariant parameterized algorithm for integer programming

A long line of research on fixed parameter tractability of integer progr...
research
01/03/2012

The RegularGcc Matrix Constraint

We study propagation of the RegularGcc global constraint. This ensures t...

Please sign up or login with your details

Forgot password? Click here to reset