An approximation to the likelihood for a pedigree with loops
Article
Received:
Accepted:
Abstract
This paper presents a new approximation to the likelihood for a pedigree with loops, based on cutting all loops and extending the pedigree at the cuts. An opimum loop-cutting strategy and an iterative extension technique are presented. The likelihood for a pedigree with loops is then approximated by the conditional likelihood for the entire cut-extended pedigree given the extended part. The approximate likelihoods are compared with the exact likelihoods obtained using the program MENDEL for several small pedigrees with loops. The approximation is efficient for large pedigrees with complex loops in terms of computing speed and memory requirements.
Key words
Likelihood Peeling Pedigree with loops Segregation analysis Linkage analysisPreview
Unable to display preview. Download preview PDF.
References
- Amos CI, Wilson AF, Rosenbaum PA, Srinivasan SR, Webber LS, Elston RC, Berenson G (1986) An approach to the multivariate analysis of high-density lipoprotein cholesterol in a large kindred: The Bogalusa heart study. Genet Epidemiol 3:255–267Google Scholar
- Cannings C, Thompson EA, Skolnick EH (1978) Probability functions on complex pedigrees. Adv Appl Prod 10:26–61Google Scholar
- Elston RC, Stewart J (1971) A general model for the genetic analysis of pedigree data. Hum Hered 21:523–542Google Scholar
- Fernando RL, Stricker C, Elston RC (1993) An efficient algorithm to compute the posterior genotypic distribution for every member of a pedigree without loops. Theor Appl Genet 87:89–93Google Scholar
- Guo SW, Thompson EA (1994) Monte Carlo estimation of mixed models for large complex pedigrees. Biometrics 50:417–432Google Scholar
- Janss LLG, van der Werf JHG, van Arendonk JAM (1992) Detection of a major gene using segregation analysis in data from several generations. In: Proc Eur Assoc Anim Prod, Madrid, pp 144Google Scholar
- Lange K (1991) Documentation for MENDEL, Version 3.0. Technical report, Department of Biomathematics, University of California, Los Angeles, CaliforniaGoogle Scholar
- Lange K, Boehnke M (1983) Extensions to pedigree analysis. V. Optimal calculation of Medelian likelihoods. Hum Hered 33: 291–301Google Scholar
- Lange K, Elston RC (1975) Extensions to pedigree analysis. I. Likelihood calculations for simple and complex pedigrees. Hum Hered 25:95–105Google Scholar
- Lange K, Matthysses S (1989) Simulation of pedigree genotypes by random walks. Am J Hum Genet 45:959–970Google Scholar
- Lange K, Sobel E (1991) A random walk method for computing genetic location scores. Am J Hum Genet 49:1320–1334Google Scholar
- Sheehan N, Thomas A (1993) On the irreducibility of a Markov chain defined on a space of genotype configuration by a sample scheme. Biometrics 49:163–175Google Scholar
- Stricker C, Fernando RL, Elston RC (1995) An algorithm to approximate the likelihood for pedigree data with loops by cutting. Theor Appl Genet 91:1054–1063Google Scholar
- Thomas A (1986a) Approximate computations of probability functions for pediaree analysis. IMA J Math Appl Med Biol 3: 157–166Google Scholar
- Thomas A (1986b) Optimal computations of probability functions for pedigree analysis. IMJ J Math Appl Med Biol 3:167–178Google Scholar
- Thomas DC, Cortessis V (1992) A Gibbs sampling approach to linkage analysis. Hum Hered 42:63–76Google Scholar
- Thompson EA, Guo SW (1991) Evaluation of likelihood ratios for complex genetic models. IMA J Math Appl Med Biol 8:149–169Google Scholar
- Thompson EA, Wijsman EML (1990) The Gibbs sampler on extended pedigrees: Monte Carlo methods for the genetic analysis of complex traits. Technical Report No. 193, Department of Statistics, University of Washington, Seattle, WashingtonGoogle Scholar
Copyright information
© Springer-Verlag 1996