Application-oriented mathematical algorithms for group testing
Csoka, E.
Show abstract
Group testing is a widely used protocol which aims to test a small group of people to identify whether at least one of them is infected. It is particularly efficient if the infection rate is low, because it only requires a single test if everybody in the group is negative. The most efficient use of group testing is a complex mathematical question. However, the answer highly depends on practical parameters and restrictions, which are partially ignored by the mathematical literature. This paper aims to offer practically efficient group testing algorithms, focusing on the current COVID-19 epidemic.
Matching journals
The top 10 journals account for 50% of the predicted probability mass.
Similar papers in this journal
- Prediction of Covid-19 spreading and optimal coordination of counter-measures: From microscopic to macroscopic models to Pareto fronts 95%
- Beyond six feet: The collective behavior of social distancing 95%
- Analytical approach of synchronous and asynchronous update schemes applied to solving biological Boolean networks 95%
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.