TY - JOUR T1 - Maximizing the mean nearest neighbor distance of a trait to choose among potential crosses and design a fully crossed mating experiment JF - bioRxiv DO - 10.1101/009720 SP - 009720 AU - Kolea Zimmerman AU - Daniel Levitis AU - Ethan Addicott AU - Anne Pringle Y1 - 2014/01/01 UR - http://biorxiv.org/content/early/2014/09/27/009720.abstract N2 - We present a novel algorithm for the design of crossing experiments. A set of individuals (a “crossing-set”) is chosen from a larger set of potential crossing-sets by maximizing the distribution of a trait of interest. In simulated mating experiments, identified crossing-sets provide better estimates of underlying parameter values than randomly chosen crossing-sets. ER -