An algorithm to generate designs for variety trials
- 1 August 1988
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Journal of Agricultural Science
- Vol. 111 (1) , 133-136
- https://doi.org/10.1017/s0021859600082927
Abstract
Summary: We describe a computer algorithm to generate efficient incomplete-block designs for any number of varieties, any number of replicates, and any number of plots per block. It considerably extends an earlier catalogue published in this Journal by Patterson, Williams & Hunter (1978). We describe also some uses of the algorithm for which no efficient designs are available from existing sources.This publication has 13 references indexed in Scilit:
- The construction of neighbour designsBiometrika, 1987
- Triangles and efficiency factorsBiometrika, 1986
- ROW AND COLUMAN DESIGNS WITH CONTIGUOUS REPLICATESAustralian Journal of Statistics, 1986
- The efficiency of incomplete block designs in National List and Recommended List cereal variety trialsThe Journal of Agricultural Science, 1983
- Circuits and efficiency in incomplete block designsBiometrika, 1983
- Statutory and Recommended List Trials of Crop Varieties in the United KingdomJournal of the Royal Statistical Society. Series A (General), 1980
- Block designs for variety trialsThe Journal of Agricultural Science, 1978
- On the Theory of Connected Designs: Characterization and OptimalityThe Annals of Statistics, 1974
- Optimality Criteria for Incomplete Block DesignsThe Annals of Mathematical Statistics, 1960
- A new method of arranging variety trials involving a large number of varietiesThe Journal of Agricultural Science, 1936