Charles F Crane | PubMed Health

PubMed2006

Identification and genetic mapping of highly polymorphic microsatellite loci from an EST database of the septoria tritici blotch pathogen Mycosphaerella graminicola.

A database of 30,137 EST sequences from Mycosphaerella graminicola, the septoria tritici blotch fungus of wheat, was scanned with a custom software pipeline for di- and trinucleotide units repeated tandemly six or more times. The bioinformatics analysis identified 109 putative SSR loci, and for 99 of them, flanking primers were developed successfully and tested for amplification and polymorphism by PCR on five field isolates of diverse origin, including the parents of the standard M. graminicola mapping population. Seventy-seven of the 99 primer pairs generated an easily scored banding pattern and 51 were polymorphic, with up to four alleles per locus, among the isolates tested. Among these 51 loci, 23 were polymorphic between the parents of the mapping population. Twenty-one of these as well as two previously published microsatellite loci were positioned on the existing genetic linkage map of M. graminicola on 13 of the 24 linkage groups. Most (66%) of the primer pairs also amplified bands in the closely related barley pathogen Septoria passerinii, but only six were polymorphic among four isolates tested. A subset of the primer pairs also revealed polymorphisms when tested with DNA from the related banana black leaf streak (Black Sigatoka) pathogen, M. fijiensis. The EST database provided an excellent source of new, highly polymorphic microsatellite markers that can be multiplexed for high-throughput genetic analyses of M. graminicola and related species.

Alleles↗

PubMed2004

A nearest-neighboring-end algorithm for genetic mapping.

MOTIVATION: High-throughput methods are beginning to make possible the genotyping of thousands of loci in thousands of individuals, which could be useful for tightly associating phenotypes to candidate loci. Current mapping algorithms cannot handle so many data without building hierarchies of framework maps. RESULTS: A version of Kruskal's minimum spanning tree algorithm can solve any genetic mapping problem that can be stated as marker deletion from a set of linkage groups. These include backcross, recombinant inbred, haploid and double-cross recombinational populations, in addition to conventional deletion and radiation hybrid populations. The algorithm progressively joins linkage groups at increasing recombination fractions between terminal markers, and attempts to recognize and correct erroneous joins at peaks in recombination fraction. The algorithm is O (mn3) for m individuals and n markers, but the mean run time scales close to mn2. It is amenable to parallel processing and has recovered true map order in simulations of large backcross, recombinant inbred and deletion populations with up to 37,005 markers. Simulations were used to investigate map accuracy in response to population size, allelic dominance, segregation distortion, missing data and random typing errors. It produced accurate maps when marker distribution was sufficiently uniform, although segregation distortion could induce translocated marker orders. The algorithm was also used to map 1003 loci in the F7 ITMI population of bread wheat, Triticum aestivum L. emend Thell., where it shortened an existing standard map by 16%, but it failed to associate blocks of markers properly across gaps within linkage groups. This was because it depends upon the rankings of recombination fractions at individual markers, and is susceptible to sampling error, typing error and joint selection involving the terminal markers of nearly finished linkage groups. Therefore, the current form of the algorithm is useful mainly to improve local marker ordering in linkage groups obtained in other ways. AVAILABILITY: The source code and supplemental data are http://www.iubio.bio.indiana.edu/soft/molbio/qtl/flipper/ CONTACT: ccrane@purdue.edu.

Algorithms↗