Journal ArticleDOI
A Method for Detecting all Defective Members in a Population by Group Testing
TLDR
A new group testing method to detect all defectives in the population when the actual number of defectives is known or when its probability distribution is known is proposed.Abstract:
Suppose a population containing items classified either as defectives or as non-defectives. This article presents a new group testing method to detect all defectives in the population. The proposed method applies either when the actual number of defectives (or an upper bound) is known or when its probability distribution is known. The method is surprisingly simple yet compares favorably with other existing methods by the number of tests required to detect all defectives.read more
Citations
More filters
Journal ArticleDOI
On the upper bound of the size of the r -cover-free families
TL;DR: In this paper, it was shown that for n sufficiently large log 2 T(r,n) n ⩽8 log 2 r r r 2 holds for any ε > 0, where r is the maximum number of subsets of an n-set satisfying a given condition.
Journal ArticleDOI
A pooled testing strategy for identifying SARS-CoV-2 at low prevalence.
Leon Mutesa,Pacifique Ndishimye,Yvan Butera,Jacob Souopgui,Jacob Souopgui,Annette Uwineza,Robert Rutayisire,Ella Larissa Ndoricimpaye,Emile Musoni,Nadine Rujeni,Thierry Nyatanyi,Edouard Ntagwabira,Muhammed Semakula,Clarisse Musanabaganwa,Daniel Nyamwasa,Maurice Ndashimye,Eva Ujeneza,Ivan Emile Mwikarago,Claude Mambo Muvunyi,Jean Baptiste Mazarati,Sabin Nsanzimana,Neil Turok,Neil Turok,Neil Turok,Wilfred Ndifon +24 more
TL;DR: An algorithm for pooling subsamples based on the geometry of a hypercube that, at low prevalence, accurately identifies individuals infected with SARS-CoV-2 in a small number of tests and few rounds of testing is proposed.
Journal ArticleDOI
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
J. Komlos,A. Greenberg +1 more
TL;DR: It is shown that if k is given {\em a priori} then such conflicts can be resolved in time Theta (k + k + k \log (n / k)) using an algorithm in which the corresponding choices do not depend on feedback.
Journal ArticleDOI
Group Testing: An Information Theory Perspective
TL;DR: A survey of recent developments in the group testing problem from an information-theoretic perspective can be found in this article, where the authors assess the theoretical guarantees in terms of scaling laws and constant factors.
Proceedings ArticleDOI
The capacity of adaptive group testing
TL;DR: In this paper, the capacity for group testing problems and deduce bounds for a variety of noisy models, based on the capacity of equivalent noisy communication channels, are defined and analyzed.
References
More filters
Journal ArticleDOI
Group testing to eliminate efficiently all defectives in a binomial sample
Milton Sobel,Phyllis A. Groll +1 more
TL;DR: In this article, the problem of finding the best integer x for the first test and to find a rule for choosing the best subsequent test-groups (which may depend on results already observed), in order to minimize the expected total number of group-tests required to classify each of the N units as good or defective is considered.
Journal ArticleDOI
A Sequential Method for Screening Experimental Variables
TL;DR: In this article, the authors describe a sequential method which may be used to determine with efficiency the important variables and interactions in an experiment, which is useful in certain cases involving up to 100,000 or more variables.
Journal ArticleDOI
A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
Frank K. Hwang,Shen Lin +1 more
TL;DR: A new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms is presented.