Even though map construction using CEPH pedigrees or radiation hybrids can be fairly rapid when marker density is low, it is extremely time consuming to validate the map by using local permutations of loci to judge the likelihood of alternative maps. When marker density is high and when models are used that incorporate genotyping errors, mutations, sex-differences, and interference, current algorithms on serial processors are extremely slow. This is particularly so for constructing consensus maps. Our experience suggests an acute need for improved algorithms, and parallel and incremental algorithms have great promise in this regard. Finally, the dense marker maps generated by the Genome Project will ultimately be used to map loci involved in complex phenotypes. However, mapping complex phenotypes on pedigrees of arbitrary structure involves very difficult computations which will require the development of parallel and incremental algorithms, such as the ones proposed here. Therefore we plan to create new faster computational techniques that will permit more realistic and sophisticated analyses of larger data sets with less time and effort than are now possible.
The specific aims are: 1. To develop parallel computational techniques for multilocus linkage analysis and radiation hybrid mapping based on both large and fine grain parallelism. The resulting software will automatically partition the computational tasks of gene mapping across an appropriate selection of computers. 2. To use techniques of incremental processing to reduce the computational overhead for repeated likelihood calculations. 3. To apply the same techniques of parallel and incremental processing as described in Aims 1 and 2 to the locus ordering problem. This will include new parallel algorithms for locus ordering as well as more efficient implementations of well-known heuristic algorithms. 4. To explore genetic chaisma interference using marker data generated by our collaborators. We plan to modify our parallel likelihood algorithms described above to allow for interference. 5. To explore differences in male and female recombination fractions using marker data generated by our collaborators. This analysis may also lead to novel models of sex-differences. 6. To create an accessible national computing resource for geneticists. In the long term, the fast computational tools and the novel algorithms developed here will enable more rapid and accurate map construction and a deeper understanding of interference and recombination in humans.

Agency
National Institute of Health (NIH)
Institute
National Human Genome Research Institute (NHGRI)
Type
Research Project (R01)
Project #
5R01HG000932-03
Application #
2209158
Study Section
Genome Study Section (GNM)
Project Start
1993-09-01
Project End
1996-08-31
Budget Start
1995-09-01
Budget End
1996-08-31
Support Year
3
Fiscal Year
1995
Total Cost
Indirect Cost
Name
University of Pittsburgh
Department
Genetics
Type
Schools of Public Health
DUNS #
053785812
City
Pittsburgh
State
PA
Country
United States
Zip Code
15213
Mukhopadhyay, Nandita; Almasy, Lee; Schroeder, Mark et al. (2005) Mega2: data-handling for facilitating genetic linkage and association analyses. Bioinformatics 21:2556-7
O'Connell, J R (2001) Rapid multipoint linkage analysis via inheritance vectors in the Elston-Stewart algorithm. Hum Hered 51:226-40
Marinov, M; Weeks, D E (2001) The complexity of linkage analysis with neural networks. Hum Hered 51:169-76
Hart, T C; Pallos, D; Bozzo, L et al. (2000) Evidence of genetic heterogeneity for hereditary gingival fibromatosis. J Dent Res 79:1758-64
O'Connell, J R (2000) Zero-recombinant haplotyping: applications to fine mapping using SNPs. Genet Epidemiol 19 Suppl 1:S64-70
O'Connell, J R; Weeks, D E (1999) An optimal algorithm for automatic genotype elimination. Am J Hum Genet 65:1733-40
Durrieu, G; Meunier, F; O'Connell, J et al. (1999) Detection of quantitative trait loci associated with alcohol-dependence: use of model-free sib-pair method and combined segregation-linkage analysis based on regressive models. Genet Epidemiol 17 Suppl 1:S145-50
Marinov, M; Matise, T C; Lathrop, G M et al. (1999) A comparison of two algorithms, MultiMap and gene mapping system, for automated construction of genetic linkage maps. Genet Epidemiol 17 Suppl 1:S649-54
O'Connell, J R; Weeks, D E (1998) PedCheck: a program for identification of genotype incompatibilities in linkage analysis. Am J Hum Genet 63:259-66
Kramer, R W; Weeks, D E; Chiarulli, D M (1995) An incremental algorithm for efficient multipoint linkage analysis. Hum Hered 45:323-36

Showing the most recent 10 out of 18 publications