Premium
Two‐stage testing using selection schemes
Author(s) -
Sudbury Aidan
Publication year - 2010
Publication title -
statistics in medicine
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.996
H-Index - 183
eISSN - 1097-0258
pISSN - 0277-6715
DOI - 10.1002/sim.3965
Subject(s) - selection (genetic algorithm) , pooling , fortran , computer science , square (algebra) , scheme (mathematics) , stage (stratigraphy) , model selection , mathematical optimization , statistics , algorithm , mathematics , artificial intelligence , programming language , mathematical analysis , paleontology , geometry , biology
In this paper, we consider pooling schemes in which samples are to be tested in two‐stages. We show that when batch size is limited as well as pool size, selection schemes tend to be more efficient and flexible. Formulae for the efficiencies of square arrays in all dimensions and for all selection schemes are given in the Appendix. A Fortran program has been written to find whether the most efficient scheme under constraints of batch and pool size be ‘square’ or ‘selection’. Copyright © 2010 John Wiley & Sons, Ltd.