ArticleTAG. Theoretical and applied genetics. Theoretische und angewandte Genetik2024
Simulation-based establishment of base pools for a hybrid breeding program in winter rapeseed.
Article in TAG. Theoretical and applied genetics. Theoretische und angewandte Genetik, 2024. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
6 citing papers in PubMed, 11 citations in OpenAlex.
- Machine learning and multi-omic analysis reveal contrasting recombination landscape of A and C subgenomes of winter oilseed rape.The plant genome · 2026Article
- Genetic Resources of Cereal and Oilseed Crops for Heterotic Hybrid Breeding.Plants (Basel, Switzerland) · 2025Review
- Heterosis and hybrid breeding.TAG. Theoretical and applied genetics. Theoretische und angewandte Genetik · 2025Article
- Optimizing the selection of quantitative traits in plant breeding using simulation.Frontiers in plant science · 2025Review
- haploMAGIC: accurate phasing and detection of recombination in multiparental populations despite genotyping errors.G3 (Bethesda, Md.) · 2024Article
- New Frontiers in Potato Breeding: Tinkering with Reproductive Genes and Apomixis.Biomolecules · 2024Review
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
8 authors at 2 institutions in 1 country.
Funding
Abstract
key messageSimulation planned pre-breeding can increase the efficiency of starting a hybrid breeding program. Starting a hybrid breeding program commonly comprises a grouping of the initial germplasm in two pools and subsequent selection on general combining ability. Investigations on pre-breeding steps before starting the selection on general combining ability are not available. Our goals were (1) to use computer simulations on the basis of DNA markers and testcross data to plan crosses that separate genetically two initial germplasm pools of rapeseed, (2) to carry out the planned crosses, and (3) to verify experimentally the pool separation as well as the increase in testcross performance. We designed a crossing program consisting of four cycles of recombination. In each cycle, the experimentally generated material was used to plan the subsequent crossing cycle with computer simulations. After finishing the crossing program, the initially overlapping pools were clearly separated in principal coordinate plots. Doubled haploid lines derived from the material of crossing cycles 1 and 2 showed an increase in relative testcross performance for yield of about 5% per cycle. We conclude that simulation-designed pre-breeding crossing schemes, that were carried out before the general combining ability-based selection of a newly started hybrid breeding program, can save time and resources, and in addition conserve more of the initial genetic variation than a direct start of a hybrid breeding program with general combining ability-based selection.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.