Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-14T22:13:35.566Z Has data issue: false hasContentIssue false

The maximum of a function of a Markov chain and application to linkage analysis

Published online by Cambridge University Press:  01 July 2016

I-Ping Tu*
Affiliation:
Stanford University
David Siegmund*
Affiliation:
Stanford University
*
∗ Postal address: Department of Health Research and Policy, Stanford University, Stanford, CA 94305, USA.
∗∗ Postal address: Department of Statistics, Stanford University, 390 Serra Mall, Stanford, CA 94305-4065, USA. Email address: dos@stat.stanford.edu

Abstract

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 (1993b) and compare the accuracy of the new approximation with that of the simpler Gaussian approximation of Feingold, Brown and Siegmund (1993) 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.

MSC classification

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable