Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes
数据结构与算法
2011-11-09 v1
摘要
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which identify the at most d items out of a given set of n items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information theoretic lower bound for the number of tests in a combinatorial group testing regimen.
引用
@article{arxiv.cs/0505048,
title = {Improved Combinatorial Group Testing Algorithms for Real-World Problem Sizes},
author = {David Eppstein and Michael T. Goodrich and Daniel S. Hirschberg},
journal= {arXiv preprint arXiv:cs/0505048},
year = {2011}
}
备注
18 pages; an abbreviated version of this paper is to appear at the 9th Worksh. Algorithms and Data Structures