Optimum allocation of resources for QTL detection using a nested association mapping strategy in maize
2010
Stich, Benjamin | Utz, H Friedrich | Piepho, Hans-Peter | Maurer, Hans P. | Melchinger, Albrecht E.
In quantitative trait locus (QTL) mapping studies, it is mandatory that the available financial resources are spent in such a way that the power for detection of QTL is maximized. The objective of this study was to optimize for three different fixed budgets the power of QTL detection 1 − β* in recombinant inbred line (RIL) populations derived from a nested design by varying (1) the genetic complexity of the trait, (2) the costs for developing, genotyping, and phenotyping RILs, (3) the total number of RILs, and (4) the number of environments and replications per environment used for phenotyping. Our computer simulations were based on empirical data of 653 single nucleotide polymorphism markers of 26 diverse maize inbred lines which were selected on the basis of 100 simple sequence repeat markers out of a worldwide sample of 260 maize inbreds to capture the maximum genetic diversity. For the standard scenario of costs, the optimum number of test environments (E opt) ranged across the examined total budgets from 7 to 19 in the scenarios with 25 QTL. In comparison, the E opt values observed for the scenarios with 50 and 100 QTL were slightly higher. Our finding of differences in 1 − β* estimates between experiments with optimally and sub-optimally allocated resources illustrated the potential to improve the power for QTL detection without increasing the total resources necessary for a QTL mapping experiment. Furthermore, the results of our study indicated that also in studies using the latest genomics tools to dissect quantitative traits, it is required to evaluate the individuals of the mapping population in a high number of environments with a high number of replications per environment.
Показать больше [+] Меньше [-]Ключевые слова АГРОВОК
Библиографическая информация
Эту запись предоставил National Agricultural Library