The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks
From MaRDI portal
Publication:2804155
DOI10.1111/ANZS.12119zbMath1336.62219OpenAlexW1557348774MaRDI QIDQ2804155
E. J. Godolphin, J. D. Godolphin
Publication date: 28 April 2016
Published in: Australian & New Zealand Journal of Statistics (Search for Journal in Brave)
Full work available at URL: http://epubs.surrey.ac.uk/808760/1/Godolphin%20-%20Revision.pdf
group divisible designconnectivityconcurrencepartially balanced designmicroarray designblock breakdown numbermaximally robust
Related Items (2)
Robust assessment of two-treatment higher-order cross-over designs against missing values ⋮ Designs with blocks of size two and applications to microarray experiments
Uses Software
Cites Work
- Unnamed Item
- Composite construction of group divisible designs
- Minimum breakdown designs in blocks of size two
- On a robustness property of PBIBD
- Group divisible designs with block size four and two groups
- Efficient design and analysis of two colour factorial microarray experiments
- Generalizing Clatworthy group divisible designs
- Conditions for the robustness of block designs against the unavailability of data
- Robustness of BIBD against the unavailability of data
- Optimality of some two-associate-class partially balanced incomplete- block designs
- Some more robust block designs against the unavailability of data
- On the theory of connected designs: Characterization and optimality
- Some new group divisible designs
- Optimality of certain asymmetrical experimental designs
- New constructions of group divisible designs
- Improved conditions for the robustness of binary block designs against the loss of whole blocks
- A note on robustness of D-optimal block designs for two-colour microarray experiments
- Simple Pilot Procedures for the Avoidance of Disconnected Experimental Designs
- Equireplicate balanced block designs with unequal block sizes
- Some Incomplete Block Designs of Maximum Efficiency
- A cyclic method of constructing regular group divisible incomplete block designs
- Construction of regular group divisible designs
- A method of construction of regular group divisible designs
- Combinatorial Properties of Group Divisible Incomplete Block Designs
This page was built for publication: The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks
