arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.6027cs.ITmath.IT
收藏

近优随机门限群测试

Near-Optimal Stochastic Threshold Group Testing

Chun Lam Chan, Sheng Cai, Mayank Bakshi, Sidharth Jaggi, Venkatesh Saligrama

摘要:

我们制定和分析的随机阈值组测试问题的动机生物应用。这里,一组$n$项目包含$d \ll n$缺陷项目的子集。测试$n$项目的子集(池)--测试结果为阴性、阳性或随机(负的或正的,具有可能取决于池中被测试的缺陷的数量的某些概率),取决于池中被测试的缺陷项目的数量是否小于{ \it下限阈值} $l$,大于{ \it上限阈值} $u$,或者在两者之间。{ \it随机阈值组测试}方案的目标是通过“少量”此类测试来识别$d$缺陷项的集合。在该政权,$l = o(d)$,我们目前的计划,计算上可行的设计和实施,并要求接近最佳的测试数量(显着改善现有的计划)。我们的计划是强大的概率阈值组测试的各种模型。

英文摘要:

We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of $n$ items contains a subset of $d \ll n$ defective items. Subsets (pools) of the $n$ items are tested -- the test outcomes are negative, positive, or stochastic (negative or positive with certain probabilities that might depend on the number of defectives being tested in the pool), depending on whether the number of defective items in the pool being tested are fewer than the {\it lower threshold} $l$, greater than the {\it upper threshold} $u$, or in between. The goal of a {\it stochastic threshold group testing} scheme is to identify the set of $d$ defective items via a "small" number of such tests. In the regime that $l = o(d)$ we present schemes that are computationally feasible to design and implement, and require near-optimal number of tests (significantly improving on existing schemes). Our schemes are robust to a variety of models for probabilistic threshold group testing.

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

↑