Loading…

Development of an algorithm identifying maximally diverse core collections

The development of a core collection, one which represents the genetic diversity of a crop with minimal redundancy and increases utility of the collection as a whole, is especially important as the funding for germplasm collections decreases. With limited resources, it is difficult to manage large g...

Full description

Saved in:
Bibliographic Details
Published in:Genetic resources and crop evolution 2000-10, Vol.47 (5), p.515-526
Main Authors: Marita, Jane M, Rodriguez, Julie M, Nienhuis, James
Format: Article
Language:English
Subjects:
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The development of a core collection, one which represents the genetic diversity of a crop with minimal redundancy and increases utility of the collection as a whole, is especially important as the funding for germplasm collections decreases. With limited resources, it is difficult to manage large germplasm collections and disperse genetically diverse germplasm to plant breeders. An algorithm was developed to assist in selection of core collections based on estimates of genetic distance. The criteria for selection of the maximum genetically diverse set were based on rankings of genetic distance between an accession with respect to all other accessions. Depending on the size core which a user wished, a zone around each selected accession was determined and no other accession within these limits was selected. The premise for the algorithm was that the genetic variability represented in the core must be representative of the distribution of genetic distances within the population of interest. In the present study, the algorithm was used with RAPD-marker-based estimates of genetic distance for 270 Theobroma cacao L. accessions and 134 Capsicum accessions that chose a set representing 18.5% of the population and representing the breadth of RAPD-based variation.
ISSN:0925-9864
1573-5109
DOI:10.1023/A:1008784610962