Data from: Selection of Pairings Reaching Evenly Across the Data (SPREAD): a simple algorithm to design maximally informative fully crossed mating experiments

Kolea Zimmerman, Daniel Levitis, Ethan Addicott & Anne Pringle
We present a novel algorithm for the design of crossing experiments. The algorithm identifies a set of individuals (a "crossing-set") from a larger pool of potential crossing-sets by maximizing the diversity of traits of interest, for example, maximizing the range of genetic and geographic distances between individuals included in the crossing-set. To calculate diversity, we use the mean nearest neighbor distance of crosses plotted in trait space. We implement our algorithm on a real dataset...
1 citation reported since publication in 2015.
93 views reported since publication in 2015.

These counts follow the COUNTER Code of Practice, meaning that Internet robots and repeats within a certain time frame are excluded.
What does this mean?
30 downloads reported since publication in 2015.

These counts follow the COUNTER Code of Practice, meaning that Internet robots and repeats within a certain time frame are excluded.
What does this mean?