A new pooling strategy for high-throughput screening: the Shifted Transversal Design.
BACKGROUND
In binary high-throughput screening projects where the goal is the identification of low-frequency events, beyond the obvious issue of efficiency, false positives and false negatives are a major concern. Pooling constitutes a natural solution: it reduces the number of tests, while providing critical duplication of the individual experiments, thereby correcting for experimental noise. The main difficulty consists in designing the pools in a manner that is both efficient and robust: few pools should be necessary to correct the errors and identify the positives, yet the experiment should not be too vulnerable to biological shakiness. For example, some information should still be obtained even if there are slightly more positives or errors than expected. This is known as the group testing problem, or pooling problem.


RESULTS
In this paper, we present a new non-adaptive combinatorial pooling design: the "shifted transversal design" (STD). It relies on arithmetics, and rests on two intuitive ideas: minimizing the co-occurrence of objects, and constructing pools of constant-sized intersections. We prove that it allows unambiguous decoding of noisy experimental observations. This design is highly flexible, and can be tailored to function robustly in a wide range of experimental settings (i.e., numbers of objects, fractions of positives, and expected error-rates). Furthermore, we show that our design compares favorably, in terms of efficiency, to the previously described non-adaptive combinatorial pooling designs.


CONCLUSIONS
This method is currently being validated by field-testing in the context of yeast-two-hybrid interactome mapping, in collaboration with Marc Vidal's lab at the Dana Farber Cancer Institute. Many similar projects could benefit from using the Shifted Transversal Design.
Thierry-Mieg
Nicolas
N
Laboratoire Logiciels-Systèmes-Réseaux, IMAG Institute, BP53, 38041 Grenoble Cedex 9, France. Nicolas.Thierry-Mieg@imag.fr
D000465:Algorithms; D000818:Animals; D002874:Chromosome Mapping / Q000379:methods*; D003198:Computer Simulation; D020869:Gene Expression Profiling / Q000379:methods*; D006801:Humans; D008954:Models, Biological; D015233:Models, Statistical; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods*; D025941:Protein Interaction Mapping / Q000379:methods*