Boosting test-efficiency by pooled testing strategies for SARS-CoV-2
Rudolf Hanel, Stefan Thurner

TL;DR
This paper presents a formula to optimize pooled testing strategies for SARS-CoV-2, significantly increasing testing efficiency at low infection rates while analyzing the impact of false negatives and replicates.
Contribution
It introduces a mathematical model to determine optimal pool sizes and efficiency gains for pooled testing based on infection levels and test accuracy.
Findings
Optimal pool size decreases as infection rate increases.
Efficiency gain is highest at low infection levels, e.g., 15 tested per test at 0.1% infection.
Pooling offers no benefit at infection levels of 30% or higher.
Abstract
In the current COVID19 crisis many national healthcare systems are confronted with an acute shortage of tests for confirming SARS-CoV-2 infections. For low overall infection levels in the population, pooling of samples can drastically amplify the testing efficiency. Here we present a formula to estimate the optimal pooling size, the efficiency gain (tested persons per test), and the expected upper bound of missed infections in the pooled testing, all as a function of the populationwide infection levels and the false negative/positive rates of the currently used PCR tests. Assuming an infection level of 0.1 % and a false negative rate of 2 %, the optimal pool size is about 32, the efficiency gain is about 15 tested persons per test. For an infection level of 1 % the optimal pool size is 11, the efficiency gain is 5.1 tested persons per test. For an infection level of 10 % the optimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSARS-CoV-2 detection and testing · Advanced Causal Inference Techniques · SARS-CoV-2 and COVID-19 Research
