Faster sequential genetic linkage computations.
Robert W. Cottingham, Ramana M. Idury, Alejandro A. Schäffer · PubMed · 1993
Linkage analysis using maximum-likelihood estimation is a powerful tool for locating genes. As available data sets have grown, the computation required for analysis has grown exponentially and become a significant impediment. Others have previously shown that parallel computation is applicable to linkage analysis and can yield order-of-magnitude improvements in speed. In this paper, we demonstrate that algorithmic modifications can also yield order-of-magnitude improvements, and sometimes much more. Using the software package LINKAGE, we describe a variety of algorithmic improvements that we have implemented, demonstrating both how these techniques are applied and their power. Experiments show that these improvements speed up the programs by an order of magnitude, on problems of moderate and large size. All improvements were made only in the combinatorial part of the code, without restoring to parallel computers. These improvements synthesize biological principles with computer science techniques, to effectively restructure the time-consuming computations in genetic linkage analysis.
Cited by 1,365 works.
Authors
References
- Strategies for multilocus linkage analysis in humans.
- A General Model for the Genetic Analysis of Pedigree Data
- Estimation of the recombination fraction in human pedigrees: efficient computation of the likelihood for human linkage studies.
- Easy calculations of lod scores and genetic risks on small computers.
- Extensions to Pedigree Analysis
- Centre d'Etude du polymorphisme humain (CEPH): Collaborative genetic mapping of the human genome
- Construction of human linkage maps: Likelihood calculations for multilocus linkage analysis
- Efficient computations in multilocus linkage analysis.
- Linkage mapping of autosomal dominant retinitis pigmentosa (RP1) to the pericentric region of human chromosome 8
- An algorithm for automatic genotype elimination.