Polycross designs with complete neighbor balance

Abstract

Polycross designs for n clones in n2 replicates, composed of n n×n squares, are presented, n being any positive integer. The method depends on whether n is odd or even, and for even n the squares are Latin. In either case, each clone has every other clone as a nearest neighbor exactly n times in each of the four primary directions (N, S, E, W) and n−2 times… (More)
DOI: 10.1007/BF00025112

Topics

  • Presentations referencing similar topics