arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1410.8440cs.ITmath.IT
收藏

带抑制因子的非适应性群体检验

Non-Adaptive Group Testing with Inhibitors

Abhinav Ganesan, Javad Ebrahimi, Sidharth Jaggi, Venkatesh Saligrama

摘要:

本文研究了Farach等人提出的带抑制剂的分组测试(GTI)。在$n$项目群体中有三种类型的项目,$d$缺陷项目、$r$抑制剂项目和$n-d-r$正常项目。测试中任何抑制剂的存在都可以阻止缺陷的表达。对于这个模型,我们提出了一个概率非自适应池设计与低复杂度的解码算法。我们表明,样本的复杂性,保证恢复所需的测试数量与消失的错误概率,使用所提出的算法规模为$T=O(d \log n)$和$T=O(\frac{r^2}{d}\log n)$的制度$r=O(d)$和$d=o(r)$分别。在前一个政权中,测试的数量满足下限顺序,而在后一个政权中,测试的数量被证明是超过下限顺序的$\log \frac{r}{d}$乘法因子。当只有上限的缺陷$D$和抑制剂$R$的数量,而不是他们的确切值,样本复杂度的测试数量使用所提出的算法规模为$T=O(D \log n)$和$T=O(R^2 \log n)$的制度$R^2=O(D)$和$D=o(R^2)$分别。在前一种情况下,测试次数满足下限阶数,而在后一种情况下,测试次数超过下限阶数一个$\log R$乘法因子。所提出的解码算法的时间复杂度为$O(nT)$。

英文摘要:

Group testing with inhibitors (GTI) introduced by Farach at al. is studied in this paper. There are three types of items, $d$ defectives, $r$ inhibitors and $n-d-r$ normal items in a population of $n$ items. The presence of any inhibitor in a test can prevent the expression of a defective. For this model, we propose a probabilistic non-adaptive pooling design with a low complexity decoding algorithm. We show that the sample complexity of the number of tests required for guaranteed recovery with vanishing error probability using the proposed algorithm scales as $T=O(d \log n)$ and $T=O(\frac{r^2}{d}\log n)$ in the regimes $r=O(d)$ and $d=o(r)$ respectively. In the former regime, the number of tests meets the lower bound order while in the latter regime, the number of tests is shown to exceed the lower bound order by a $\log \frac{r}{d}$ multiplicative factor. When only upper bounds on the number of defectives $D$ and the number of inhibitors $R$ are given instead of their exact values, the sample complexity of the number of tests using the proposed algorithm scales as $T=O(D \log n)$ and $T=O(R^2 \log n)$ in the regimes $R^2=O(D)$ and $D=o(R^2)$ respectively. In the former regime, the number of tests meets the lower bound order while in the latter regime, the number of tests exceeds the lower bound order by a $\log R$ multiplicative factor. The time complexity of the proposed decoding algorithms scale as $O(nT)$.

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

↑