Answers are grounded in this paper and cite their sources.
This research adapts semigroup basis pruning algorithms to optimize crossing primitives in breeding programs, suggesting efficient breeding outcomes.
Abstract Genetic breeding programs combine parental lines through crossing operations to produce new varieties. The space of possible crosses and breeding procedures can be very large, but often a much smaller set of crossing primitives suffices to generate the same set of achievable lines. We adapt semigroup basis pruning algorithms by to the breeding setting by modeling breeding operations as transformations on a finite population state space. We provide formal definitions, proofs of algorithmic correctness and termination for the finite case, and a worked example using a small set of parental lines. The example includes an executable Python implementation which identifies a minimal generating set of crosses for the target breeding outcomes. The approach offers a principled method to reduce complexity in breeding programs, identify critical parental lines, and prioritize crosses under resource constraints.
No takes yet. Share an insight, caveat, or question.
Sampson et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: