Abstract
Spatial randomization of clones across a seed orchard’s grid is commonly applied to promote cross-fertilization and minimize selfing. The high selection differential attained from advanced-generation breeding programs sets high premier on the genetic gain and diversity delivery from seed orchards, thus clonal allocation is important and even more challenging when clones share common ancestry. Evidences of low selfing in many conifers’ seed orchards, as a result of their high genetic load, inbreeding depression, and polyembryony are abundant and call for orchards’ design re-evaluation, specifically when randomization is associated with added managerial burden. Clonal-rows represent a viable option for simplifying orchards management; however, they are often associated with elevated correlated matings between adjacent clones. Here, we propose a modified clonal-row design that replicates, staggers, and randomizes the rows, thus doubling the number of adjacent clones and providing different set of neighboring clones at each replication, thus allowing accommodating related parents more readily than any single-tree arrangement. We present a novel algorithm packaged in user-friendly software for executing various seed orchards’ designs. The developed program is interactive and suitable for any orchard size and configuration, accommodates any number of clones that are allocated to rows with variable length (ranging from a single tree to any even number) and pre-set separation zone between ramets of the same clone. The program offers three deployment modes (equal, linear, and custom) each with multiple layouts determined by the number of iterations requested. The resulting layouts are ranked based on four criteria including: (1) the number of empty positions, (2) deviation between expected and observed clone size, (3) minimum inbreeding, and (4) a neighborhood index that expresses the efficiency of clonal distribution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.