Author
 |
Crane, Charles |
|
Submitted to: International Triticeae Mapping Initiative Workshop
Publication Type: Abstract Only Publication Acceptance Date: 4/23/2004 Publication Date: N/A Citation: N/A Interpretive Summary: Technical Abstract: The nearest-neighboring-ends algorithm, a variant of Kruskal's minimum spanning tree algorithm, was applied to publicly available segregation data on GrainGenes for 1003 markers in the W7984 x Opata 85 mapping population of 114 F7 individuals of wheat (Triticum aestivum L.). This algorithm treats RIL mapping as deletion from the F1 genotype, where each parental allele is treated as a separate locus. It therefore produced separate maps for 21 linkage groups in W7984 and 21 linkage groups in Opata 85 when published assignments of markers to linkage groups were accepted. When applied to the entire segregating data set, it concatenated various published linkage groups and split others, on account of the small population size, the gapped distribution of markers in recombinational space, and likely typing errors at certain markers. Nevertheless, it shortened the published map by 16.0% when applied in this way, and it shortened individual linkage groups by 1.4% to 26.1% when published marker assignments to linkage group were accepted. Gaps remain a major problem to be solved; they might be related to recombination within heterochromatic, highly repetitive C-bands. |
