Group Testing with Blocks of Positives and Inhibitors

• Published in: Entropy (Basel, Switzerland) Vol. 24; no. 11; p. 1562
• Main Authors: Bui, Thach V., Echizen, Isao, Kuribayashi, Minoru, Kojima, Tetsuya, Nguyen, Thuc D.
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 30.10.2022; MDPI
• Subjects: Analysis; Block designs; Coding theory; combinatorics; Design; Group theory; Inhibitors; Model testing; non-adaptive group testing; Probability distribution; sparse recovery; sub-linear algorithms; Testing; Singapore
• ISSN: 1099-4300; 1099-4300
• DOI: 10.3390/e24111562

The main goal of group testing is to identify a small number of specific items among a large population of items. In this paper, we consider specific items as positives and inhibitors and non-specific items as negatives. In particular, we consider a novel model called group testing with blocks of positives and inhibitors. A test on a subset of items is positive if the subset contains at least one positive and does not contain any inhibitors, and it is negative otherwise. In this model, the input items are linearly ordered, and the positives and inhibitors are subsets of small blocks (at unknown locations) of consecutive items over that order. We also consider two specific instantiations of this model. The first instantiation is that model that contains a single block of consecutive items consisting of exactly known numbers of positives and inhibitors. The second instantiation is the model that contains a single block of consecutive items containing known numbers of positives and inhibitors. Our contribution is to propose efficient encoding and decoding schemes such that the numbers of tests used to identify only positives or both positives and inhibitors are less than the ones in the state-of-the-art schemes. Moreover, the decoding times mostly scale to the numbers of tests that are significantly smaller than the state-of-the-art ones, which scale to both the number of tests and the number of items.