ERROR-TOLERANT TRIVIAL TWO-STAGE GROUP TESTING FOR COMPLEXES USING ALMOST SEPARABLE AND ALMOST DISJUNCT MATRICES

Abstract

In this paper, we define an α-almost (k; 2e + 1)-separable matrix and an α-almostke-disjunct matrix. Using their complements, we devise algorithms for fault-tolerant trivial two-stage group tests (pooling designs) for k-complexes. We derive the expected values for the given algorithms to identify all such positive complexes.