Cargando…

Heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems

BACKGROUND: Over the last decade genetic marker-based plant breeding strategies have gained increasing attention because genotyping technologies are no longer limiting. Now the challenge is to optimally use genetic markers in practical breeding schemes. For simple traits such as some disease resista...

Descripción completa

Detalles Bibliográficos
Autores principales: Beukelaer, Herman De, Meyer, Geert De, Fack, Veerle
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2015
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4332449/
https://www.ncbi.nlm.nih.gov/pubmed/25634328
http://dx.doi.org/10.1186/s12863-014-0154-z
_version_ 1782357913651642368
author Beukelaer, Herman De
Meyer, Geert De
Fack, Veerle
author_facet Beukelaer, Herman De
Meyer, Geert De
Fack, Veerle
author_sort Beukelaer, Herman De
collection PubMed
description BACKGROUND: Over the last decade genetic marker-based plant breeding strategies have gained increasing attention because genotyping technologies are no longer limiting. Now the challenge is to optimally use genetic markers in practical breeding schemes. For simple traits such as some disease resistances it is possible to target a fixed multi-locus allele configuration at a small number of causal or linked loci. Efficiently obtaining this genetic ideotype from a given set of parental genotypes is known as the marker-assisted gene pyramiding problem. Previous methods either imposed strong restrictions or used black box integer programming solutions, while this paper explores the power of an explicit heuristic approach that exploits the underlying genetic structure to prune the search space. RESULTS: Gene Stacker is introduced as a novel approach to marker-assisted gene pyramiding, combining an explicit directed acyclic graph model with a pruned generation algorithm inspired by a simple exhaustive search. Both exact and heuristic pruning criteria are applied to reduce the number of generated schedules. It is shown that this approach can effectively be used to obtain good solutions for stacking problems of varying complexity. For more complex problems, the heuristics allow to obtain valuable approximations. For smaller problems, fewer heuristics can be applied, resulting in an interesting quality-runtime tradeoff. Gene Stacker is competitive with previous methods and often finds better and/or additional solutions within reasonable time, because of the powerful heuristics. CONCLUSIONS: The proposed approach was confirmed to be feasible in combination with heuristics to cope with realistic, complex stacking problems. The inherent flexibility of this approach allows to easily address important breeding constraints so that the obtained schedules can be widely used in practice without major modifications. In addition, the ideas applied for Gene Stacker can be incorporated in and extended for a plant breeding context that e.g. also addresses complex quantitative traits or conservation of genetic background. Gene Stacker is freely available as open source software at http://genestacker.ugent.be. The website also provides documentation and examples of how to use Gene Stacker. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1186/s12863-014-0154-z) contains supplementary material, which is available to authorized users.
format Online
Article
Text
id pubmed-4332449
institution National Center for Biotechnology Information
language English
publishDate 2015
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-43324492015-02-19 Heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems Beukelaer, Herman De Meyer, Geert De Fack, Veerle BMC Genet Research Article BACKGROUND: Over the last decade genetic marker-based plant breeding strategies have gained increasing attention because genotyping technologies are no longer limiting. Now the challenge is to optimally use genetic markers in practical breeding schemes. For simple traits such as some disease resistances it is possible to target a fixed multi-locus allele configuration at a small number of causal or linked loci. Efficiently obtaining this genetic ideotype from a given set of parental genotypes is known as the marker-assisted gene pyramiding problem. Previous methods either imposed strong restrictions or used black box integer programming solutions, while this paper explores the power of an explicit heuristic approach that exploits the underlying genetic structure to prune the search space. RESULTS: Gene Stacker is introduced as a novel approach to marker-assisted gene pyramiding, combining an explicit directed acyclic graph model with a pruned generation algorithm inspired by a simple exhaustive search. Both exact and heuristic pruning criteria are applied to reduce the number of generated schedules. It is shown that this approach can effectively be used to obtain good solutions for stacking problems of varying complexity. For more complex problems, the heuristics allow to obtain valuable approximations. For smaller problems, fewer heuristics can be applied, resulting in an interesting quality-runtime tradeoff. Gene Stacker is competitive with previous methods and often finds better and/or additional solutions within reasonable time, because of the powerful heuristics. CONCLUSIONS: The proposed approach was confirmed to be feasible in combination with heuristics to cope with realistic, complex stacking problems. The inherent flexibility of this approach allows to easily address important breeding constraints so that the obtained schedules can be widely used in practice without major modifications. In addition, the ideas applied for Gene Stacker can be incorporated in and extended for a plant breeding context that e.g. also addresses complex quantitative traits or conservation of genetic background. Gene Stacker is freely available as open source software at http://genestacker.ugent.be. The website also provides documentation and examples of how to use Gene Stacker. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1186/s12863-014-0154-z) contains supplementary material, which is available to authorized users. BioMed Central 2015-01-30 /pmc/articles/PMC4332449/ /pubmed/25634328 http://dx.doi.org/10.1186/s12863-014-0154-z Text en © De Beukelaer et al.; licensee BioMed Central. 2015 This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
spellingShingle Research Article
Beukelaer, Herman De
Meyer, Geert De
Fack, Veerle
Heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems
title Heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems
title_full Heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems
title_fullStr Heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems
title_full_unstemmed Heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems
title_short Heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems
title_sort heuristic exploitation of genetic structure in marker-assisted gene pyramiding problems
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4332449/
https://www.ncbi.nlm.nih.gov/pubmed/25634328
http://dx.doi.org/10.1186/s12863-014-0154-z
work_keys_str_mv AT beukelaerhermande heuristicexploitationofgeneticstructureinmarkerassistedgenepyramidingproblems
AT meyergeertde heuristicexploitationofgeneticstructureinmarkerassistedgenepyramidingproblems
AT fackveerle heuristicexploitationofgeneticstructureinmarkerassistedgenepyramidingproblems