arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/9411219math.COcs.CC
收藏

利用子集查询识别子集成员的下界

Lower bounds for identifying subset members with subset queries

Emanuel Knill

摘要:

一组测试问题的实例是一组对象$\cO$和$\cO$的未知子集$P$。任务是通过使用类型为“$P$与$Q$相交吗”的查询来确定$P$,其中$Q$是$\cO$的子集。这个问题发生在诸如故障检测、多路访问通信、最优搜索、血液检测和染色体映射等领域。考虑求解一组测试问题的两阶段算法。在第一阶段中,并行地询问预定的查询集合,并且在第二阶段中,通过测试各个对象来确定$P$。令$n=\cardof{\cO}$。假设通过以概率$p/n$将每个$x\in \cO$独立地添加到$P$来生成$P$。令$q_1$($q_2$)是在该算法的第一(第二)阶段中询问的查询的数量。我们表明,如果$q_1=o(\log(n)\log(n)/\log\log(n))$,那么$\Exp(q_2) = n^{1-o(1)}$,而存在的算法与$q_1 = O(\log(n)\log(n)/\log\log(n))$和$\Exp(q_2) = o(1)$。证明涉及到一个松弛技术,可用于任意分布。以前已知的最佳界限是$q_1+\Exp(q_2) = Ω(p\log(n))$。对于一般的组测试算法,我们的研究结果意味着,如果在$n^γ$($γ>0$)独立实验的过程中查询的平均数是$O(n^{1-ε})$,那么以高概率$Ω(\log(n)\log(n)/\log\log(n))$非单例子集查询。这解决了Bill Bruno和David Torney的一个猜想,并且对于在筛选DNA文库和其他应用中使用组测试具有重要的影响,在这些应用中,使用非自适应算法更具成本效益,并且/或者为第一次测试准备子集$Q$太昂贵。

英文摘要:

An instance of a group testing problem is a set of objects $\cO$ and an unknown subset $P$ of $\cO$. The task is to determine $P$ by using queries of the type ``does $P$ intersect $Q$'', where $Q$ is a subset of $\cO$. This problem occurs in areas such as fault detection, multiaccess communications, optimal search, blood testing and chromosome mapping. Consider the two stage algorithm for solving a group testing problem. In the first stage a predetermined set of queries are asked in parallel and in the second stage, $P$ is determined by testing individual objects. Let $n=\cardof{\cO}$. Suppose that $P$ is generated by independently adding each $x\in \cO$ to $P$ with probability $p/n$. Let $q_1$ ($q_2$) be the number of queries asked in the first (second) stage of this algorithm. We show that if $q_1=o(\log(n)\log(n)/\log\log(n))$, then $\Exp(q_2) = n^{1-o(1)}$, while there exist algorithms with $q_1 = O(\log(n)\log(n)/\log\log(n))$ and $\Exp(q_2) = o(1)$. The proof involves a relaxation technique which can be used with arbitrary distributions. The best previously known bound is $q_1+\Exp(q_2) = Ω(p\log(n))$. For general group testing algorithms, our results imply that if the average number of queries over the course of $n^γ$ ($γ>0$) independent experiments is $O(n^{1-ε})$, then with high probability $Ω(\log(n)\log(n)/\log\log(n))$ non-singleton subsets are queried. This settles a conjecture of Bill Bruno and David Torney and has important consequences for the use of group testing in screening DNA libraries and other applications where it is more cost effective to use non-adaptive algorithms and/or too expensive to prepare a subset $Q$ for its first test.

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

↑