๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal block designs for diallel crosses

โœ Scribed by M. K. Sharma; Sileshi Fanta


Book ID
105856899
Publisher
Springer
Year
2009
Tongue
English
Weight
173 KB
Volume
71
Category
Article
ISSN
0026-1335

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Optimal designs for diallel cross experi
โœ Ashish Das; Aloke Dey; Angela M. Dean ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 560 KB

Using nested balanced incomplete block designs, new families of optimal block designs for a certain type of diallel cross experiments are obtained. It is further shown that triangular partially balanced incomplete block designs satisfying a certain parametric condition also lead to optimal designs f

Analysis of Diallel Table for Experiment
โœ Dr. B. Ceranka; Dr. H. Kielczewska ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 410 KB ๐Ÿ‘ 2 views

In this paper the analysis of genotypes obtained in diallel crossing system, including parents, one set of F,'s and reciprocal Fl's, is given. This analysis is presented for data obtained from the experiments laid out in block designs. The analysis of variance, estimator of reciprocal effects, estim

Analysis of Triangular Diallel Table for
โœ Dr. B. Ceranka; Dr. H. Kielczewska ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 355 KB ๐Ÿ‘ 2 views

In tliis paper the analysis of genotypes obtained in diallel crossing system, including one set of Fi's and parents, arranged in triangular table is given. This analysis is presented for data obtained from the experiments laid o u t in block designs. The analysis of variance, estimators of general a

On someE-optimal block designs
โœ Aloke Dey; Ashish Das ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Springer ๐ŸŒ English โš– 300 KB
Searching for Optimal Block Designs when
โœ Dr. B. Jones ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 394 KB ๐Ÿ‘ 1 views

A n algorithm that seercbw for optimal block designs when block effecta are random is deecribed. Some eituatione in which eucb an algorithm will prove ueeful are coneidered. An illuetrative example and mme discurnion are given.