Scholarlink

Abstract <p>An algorithm is described for group testing under the conditions when, in a specified set of cardinality <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11487_2025_2234_Article_IEq1.gif" Format="GIF" Height="10" Rendition="HTML" Resolution="72" Type="Linedraw" Width="14" /> </InlineMediaObject> <EquationSource Format="TEX">\(n\)</EquationSource> <!--ComTech2570023Gorbunov-m1--> </InlineEquation>, there is an unknown amount of <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11487_2025_2234_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="41" /> </InlineMediaObject> <EquationSource Format="TEX">\(d &gt; 0\)</EquationSource> <!--ComTech2570023Gorbunov-m2--> </InlineEquation> of defective elements and it is necessary to identify them with a sequence of tests. Each next test can take into account the results of the previous ones. The upper estimate for the number of tests in our algorithm improves the known value. The algorithm runtime is the minimum possible: it is of the order of the number of tests.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Adaptive Group Testing Algorithm

  • 期刊论文

  • 发表日期：

    2025年3月1日

查看全文
  • K. Yu. Gorbunov

摘要

Abstract

An algorithm is described for group testing under the conditions when, in a specified set of cardinality \(n\) , there is an unknown amount of \(d > 0\) of defective elements and it is necessary to identify them with a sequence of tests. Each next test can take into account the results of the previous ones. The upper estimate for the number of tests in our algorithm improves the known value. The algorithm runtime is the minimum possible: it is of the order of the number of tests.