arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.10971cs.ITcs.DSmath.IT
收藏

紧急约束下的近优池测试

Near-Optimal Pool Testing under Urgency Constraints

Éric Brier, Megi Dervishi, Rémi Géraud-Stewart, David Naccache, Ofer Yifrach-Stav

摘要:

在大量人群中检测罕见性状或疾病具有挑战性。混合测试可以以较低的成本覆盖更大范围的人口,同时简化后勤工作。然而,检测精度降低,因为不清楚池中的哪个成员使全局检测呈阳性。在本文中,我们讨论的测试策略,可证明的方法最好的可能的战略-最佳的意义上说,没有其他的策略可以得到确切的结果与较少的测试。我们的算法保证他们提供了一个完整和准确的结果,为每个人,而不超过$1/0.99$倍的测试数量的最佳策略将需要。这个阈值是任意的:可以描述更接近最优边界的算法,但它们的复杂性会增加,使它们不太实用。此外,算法处理输入样本的方式导致更快地知道一些个体的状态,从而允许在将个体分配给测试时考虑紧急性。

英文摘要:

Detection of rare traits or diseases in a large population is challenging. Pool testing allows covering larger swathes of population at a reduced cost, while simplifying logistics. However, testing precision decreases as it becomes unclear which member of a pool made the global test positive. In this paper we discuss testing strategies that provably approach best-possible strategy - optimal in the sense that no other strategy can give exact results with fewer tests. Our algorithms guarantee that they provide a complete and exact result for every individual, without exceeding $1/0.99$ times the number of tests the optimal strategy would require. This threshold is arbitrary: algorithms closer to the optimal bound can be described, however their complexity increases, making them less practical. Moreover, the way the algorithms process input samples leads to some individuals' status to be known sooner, thus allowing to take urgency into account when assigning individuals to tests.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑