Skip to main content
Log in

An algorithm to approximate the likelihood for pedigree data with loops by cutting

  • Published:
Theoretical and Applied Genetics Aims and scope Submit manuscript

Abstract

This paper presents a recursive algorithm to approximate the likelihood in arbitrary pedigrees with loops. The algorithm handles any number and nesting levels of loops in pedigrees. The loops are cut as described in a previous publication and the approximate likelihood is simultaneously computed using the cut pedigree. No identification of a loop in the pedigree is necessary before the algorithm is applied.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

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–267

    Google Scholar 

  • Bondy JA, Murty USR (1976) Graph theory with applications. North Holland, New York

    Google Scholar 

  • Cannings C, Thompson EA, Skolnick MH (1978) Probability funcon complex pedigrees. Adv Appl Prob 10:26–61

    Google Scholar 

  • Elston RC, Stewart J (1971) A general model for the genetic analysis of pedigree data. Hum Hered 21:523–542

    Google 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–93

    Google Scholar 

  • Hagger C (1992) Two generations of selection on restricted best linear unbiased prediction breeding values for income minus feed cost in laying hens. J Anim Sci 70:2045–2052

    Google Scholar 

  • Hasstedt SJ (1994) PAP: pedigree analysis package, rev 4. Department of Human Genetics, University of Utah, Salt Lake City

    Google Scholar 

  • Janss LLG, Van der Werf JHJ, Van Arendonk JAM (1992) Detection of a major gene using segregation analysis in data from several generations. In: Proc Europ Assoc Anim Prod, Session 5a, Free Communications, p 144

  • Kong A (1991) Analysis of pedigree data using methods combining peeling and gibbs sampling. In: Keramidas EM (ed) Computing science and statistics. Proc 23rd Symp on the Interface, April 21–24, pp 379–384

  • Lange K (1991) Documentation for MENDEL, version 3.0. Technical report, Department of Biomathematics, University of California, Los Angeles, California, USA

    Google Scholar 

  • Lange K, Boehnke M (1983) Extensions to pedigree analysis.V. Optimal calculation of Mendelian likelihoods. Hum Hered 33:291–301

    CAS  Google Scholar 

  • Lange K, Elston RC (1975) Extension to pedigree analysis.I. Likelihood calculations for simple and complex pedigrees. Hum Hered 25:95–105

    Google Scholar 

  • Sheehan NA (1989) Image-processing procedures applied to the estimation of genotypes on pedigrees. Technical Report 176, Department of Statistics, University of Washington, Seattle, Washington, USA

    Google Scholar 

  • Strickberger MW (1976) Genetics MacMillan Publishing Company, New York

    Google Scholar 

  • Stricker C, Fernando RL, Elston RC (1995) SALP—Segregation and linkage analysis for pedigrees, release 2.0, computer program package. Federal Institute of Technology ETH, Institute of Animal Sciences, Zürich, Switzerland

    Google Scholar 

  • Thomas A (1986) Optimal computations of probability functions for pedigree analysis. IMA J Math Appl Med Biol 3:167–178

    Google Scholar 

  • Thompson EA (1981) Pedigree analysis of hodgkins disease in a newfoundland genealogy. Ann Hum Genet 45:279–292

    Google Scholar 

  • Thompson EA, Guo SW (1991) Estimation of likelihood ratios for complex genetic models. IMA J Math Appl Med Biol 8:149–169

    Google Scholar 

  • Thompson EA, Wijsman EM (1990) The gibbs sampler on extended pedigrees: Monte carlo method for the genetic analysis of complex traits. Technical Report 193, Department of Statistics, GN-22, University of Washington, Seattle, Washington, USA

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by E. J. Eisen

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stricker, C., Fernando, R.L. & Elston, R.C. An algorithm to approximate the likelihood for pedigree data with loops by cutting. Theoret. Appl. Genetics 91, 1054–1063 (1995). https://doi.org/10.1007/BF00223919

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00223919

Key words

Navigation