Improved genetic distance-based spatial deployment can effectively minimize inbreeding in seed orchard
Bibliographic record
Abstract
Abstract Background Inbreeding in seed orchards is expected to increase with the advancement of breeding cycles, which results in the delivery of crops with suboptimal genetic gain, reduced genetic diversity, and lower seed set. Here, a genetic distance-dependent method for clonal spatial deployment in seed orchards was developed and demonstrated, which reduced the inbreeding levels. The method’s main evaluation parameter of inbreeding is the genetic distance among individuals and the deployment method used an improved adaptive parallel genetic algorithm (IAPGA) based on Python language. Using inbreeding-prone Chinese Mongolian pine breeding population material originating from a single natural population, the proposed method was compared to a traditional orchard design and a distance-based design; namely, complete randomized block (RCB) and optimum neighborhood (ONA) designs, respectively. Results With the advancement of selective breeding cycles, group separation among orchard related individuals is expected to increase. Based on the genetic distance among individuals, the IAPGA design was superior in significantly reducing the inbreeding level as compared to the two existing designs, confirming its suitability to advanced-generation orchards where relatedness among parents is common. In the 1st, 2nd, and mixed generations clonal deployment schemes, the IAPGA design produced lower inbreeding with 87.22%, 81.49%, and 87.23% of RCB, and 92.78%, 91.30%, and 91.67% of ONA designs, respectively. Conclusions The IAPGA clonal deployment proposed in this study has the obvious advantage of controlling inbreeding, and it is expected to be used in clonal deployment in seed orchards on a large-scale. Further studies are needed to focus on the actual states of pollen dispersal and mating in seed orchards, and more assumptions should be taken into account for the optimized deployment method.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".