DISS_abstract\u3e Since the early 1940s, group testing has been widely used to reduce costs in a variety of applications, including infectious disease screening, drug discovery, and genetics. Statistical research in group testing generally splits into two areas: classification and estimation. Following this bifurcated structure, this dissertation consists of three research problems which address methods of classification and estimation in a heterogeneous population. The goal of classification is to identify all positives among those individuals screened using initial group testing results and the subsequent process of decoding of positive pools. Many decoding algorithms have been proposed, but most fail to acknowledge, and to further exploi...
The group testing problem asks for efficient pooling schemes and inference algorithms that allow to ...
We construct optimal designs for group testing experiments where the goal is to estimate the prevale...
The group testing problem asks to find d<n defective elements out of n elements, by testing subsets ...
Group testing, where groups of individual specimens are composited to test for the presence or absen...
Group testing is the process of pooling samples (e.g., blood, chemical compounds) from multiple sour...
In the simplest form of group testing, pools are formed by compositing a fixed number of individual ...
When the prevalence of a disease or of some other binary characteristic is small, group testing (als...
Group testing, introduced by Dorfman (1943), has been used to reduce costs when estimating the preva...
Group testing is a cost efficient technique first proposed by Dorfman (1943) to detect soldiers with...
Identification of defective members of large populations has been widely studied in the statistics c...
We propose a novel group testing framework, termed semi-quantitative group testing, motivated by a c...
Group testing, where groups of individual specimens are composited to test for the presence or absen...
Abstract—Identification of defective members of large popula-tions has been widely studied in the st...
Group testing is the process of combining items into groups to test for a binary characteristic. One...
This dissertation consists of three projects in the area of group testing. The method of group testi...
The group testing problem asks for efficient pooling schemes and inference algorithms that allow to ...
We construct optimal designs for group testing experiments where the goal is to estimate the prevale...
The group testing problem asks to find d<n defective elements out of n elements, by testing subsets ...
Group testing, where groups of individual specimens are composited to test for the presence or absen...
Group testing is the process of pooling samples (e.g., blood, chemical compounds) from multiple sour...
In the simplest form of group testing, pools are formed by compositing a fixed number of individual ...
When the prevalence of a disease or of some other binary characteristic is small, group testing (als...
Group testing, introduced by Dorfman (1943), has been used to reduce costs when estimating the preva...
Group testing is a cost efficient technique first proposed by Dorfman (1943) to detect soldiers with...
Identification of defective members of large populations has been widely studied in the statistics c...
We propose a novel group testing framework, termed semi-quantitative group testing, motivated by a c...
Group testing, where groups of individual specimens are composited to test for the presence or absen...
Abstract—Identification of defective members of large popula-tions has been widely studied in the st...
Group testing is the process of combining items into groups to test for a binary characteristic. One...
This dissertation consists of three projects in the area of group testing. The method of group testi...
The group testing problem asks for efficient pooling schemes and inference algorithms that allow to ...
We construct optimal designs for group testing experiments where the goal is to estimate the prevale...
The group testing problem asks to find d<n defective elements out of n elements, by testing subsets ...