Date |
Content of the Lecture |
Assignments/Readings/Notes |
| 30/6 (Mon) |
- Course content overview
- Definition of group testing, Motivating examples for group testing
- Overview of applications
- Broad Taxonomy
|
|
| 30/6 (Mon) |
- Adaptive group testing
- Dorfman's method with analysis
- Binary splitting and generalized binary splitting
|
|
| 1/7 (Tue) |
- Non-Adaptive group testing
- Concept of k-separable, k'-separable, k-disjunct pooling matrices
- Non-adaptive algorithms: smallest satisfying set (SSS) and Combinatorial Orthogonal Matching Pursuit (DD)
- Non-adaptive algorithms: definite defectives (DD), Sequential COMP (SCOMP), Linear Programming Relaxation (LPR)
|
|
| 1/7 (Tue) |
- Analysis of COMP, DD, SCOMP
- Proof that random Bernoulli matrices are disjunct matrices
- Distance decoding algorithm
|
|
| 2/7 (Wed) |
- Noise models in group testing
- Noisy linear programming relaxation
- Noisy COMP with analysis
|
|
| 2/7 (Wed) |
- Noise definite defectives
- Noisy distance decoding and (k,e)-disjunct matrices
|
|
| 3/7 (Thurs) |
- Real-valued group testing: Tapestry algorithm
- Overview of RTPCR
|
|
| 3/7 (Thurs) |
- Near-neighbor search using binary splitting
|
|