✦ LIBER ✦
Trivial two-stage group testing for complexes using almost disjunct matrices
✍ Scribed by Anthony J. Macula; Vyacheslav V. Rykov; Sergey Yekhanin
- Book ID
- 104294168
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 230 KB
- Volume
- 137
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
✦ Synopsis
Let [t]
represent a ÿnite population with t elements. Suppose we have an unknown d-family of k-subsets of [t]. We refer to as the set of positive k-complexes. In the group testing for complexes problem, must be identiÿed by performing 0, 1 tests on subsets or pools of [t]. A pool is said to be positive if it completely contains a complex; otherwise the pool is said to be negative. In classical group testing, each member of is a singleton. In this paper, we exhibit and analyze a probabilistic trivial two-stage algorithm that identiÿes the positive complexes.