Application-oriented mathematical algorithms for group testing
This work addresses the challenge of minimizing test usage in large-scale screening, such as in disease detection, but it is incremental as it builds on existing mathematical knowledge.
The paper tackles the problem of efficiently identifying infected samples using group testing, particularly when infection rates are low, by summarizing and extending mathematical algorithms with a focus on real-life applications.
We have a large number of samples and we want to find the infected ones using as few number of tests as possible. We can use group testing which tells about a small group of people whether at least one of them is infected. Group testing is particularly efficient if the infection rate is low. The goal of this article is to summarize and extend the mathematical knowledge about the most efficient group testing algorithms, focusing on real-life applications instead of pure mathematical motivations and approaches.