Article ID: | iaor20002952 |
Country: | United States |
Volume: | 31 |
Issue: | 2 |
Start Page Number: | 510 |
End Page Number: | 531 |
Publication Date: | Jun 1999 |
Journal: | Advances in Applied Probability |
Authors: | Tu I-Ping, Siegmund David |
Keywords: | matrices |
One method of linkage analysis in humans is based on identity-by-descent of pairs of relatives who share a phenotype of interest (for example, a particular disease). We replace the convenient assumption of continuous specification of regions of identity by descent by the more realistic, although still artificially simple, assumption of data from a discrete set of equally spaced infinitely polymorphic markers. We generalize the continuous time Markov chain analysis of Feingold and compare the accuracy of the new approximation with that of the simpler Gaussian approximation of Feingold, Brown and Siegmund under a variety of assumptions about the composition of the pedigrees to be studied. We also suggest a perturbation of the Gaussian approximation as a compromise to achieve reasonable accuracy with minimal computational effort.