2009
DOI: 10.1186/1471-2105-10-243
|View full text |Cite
|
Sign up to set email alerts
|

Core Hunter: an algorithm for sampling genetic resources based on multiple genetic measures

Abstract: Background: Existing algorithms and methods for forming diverse core subsets currently address either allele representativeness (breeder's preference) or allele richness (taxonomist's preference). The main objective of this paper is to propose a powerful yet flexible algorithm capable of selecting core subsets that have high average genetic distance between accessions, or rich genetic diversity overall, or a combination of both.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
143
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 143 publications
(146 citation statements)
references
References 30 publications
3
143
0
Order By: Relevance
“…Because different strategies result in different core collections (Thachuk et al 2009, Wang et al 2007), we used four different methods. As the M strategy is based on maximizing the number of alleles, it can automatically generate a sampling ratio on the basis of the genetic diversity of the species; this strategy has been widely used in recent years (Belaj et al 2012, Liu et al 2015, Zhang et al 2011).…”
Section: Discussionmentioning
confidence: 99%
“…Because different strategies result in different core collections (Thachuk et al 2009, Wang et al 2007), we used four different methods. As the M strategy is based on maximizing the number of alleles, it can automatically generate a sampling ratio on the basis of the genetic diversity of the species; this strategy has been widely used in recent years (Belaj et al 2012, Liu et al 2015, Zhang et al 2011).…”
Section: Discussionmentioning
confidence: 99%
“…As a result, the genebank users obtain a focused selection of the germplasm with more useful diversity of the trait of interest than core collections. Likewise, algorithms such as Core Hunter assist defining core subsets based on user preference but having enough genetic diversity and appropriate average genetic distance among accessions (Thachuk et al 2009). Core Hunter can also find small core subsets that still keep all unique alleles found in the reference germplasm collection.…”
Section: Genebank Sampling and Core Subsetsmentioning
confidence: 99%
“…M-Strat (Gouesnard et al 2001), Genetic distance sampling (Jansen and Van Hintum 2007), Power Core (Kim et al 2007) and Core Hunter (Thachuk et al 2009). Similarly core has been developed using several kinds of data ranging from genealogical data in the Czech spring wheat (Stehno et al 2006), agronomic data in groundnut (Upadhyaya 2003;Upadhyaya et al 2003) and molecular data or integration of data in bread wheat (Balfourier et al 2007) and in rice (Borba et al 2009;Yan et al 2007).…”
Section: Core Set Developmentmentioning
confidence: 99%