An algorithm to approximate the likelihood for pedigree data with loops by cutting
- 1 November 1995
- journal article
- Published by Springer Nature in Theoretical and Applied Genetics
- Vol. 91 (6) , 1054-1063
- https://doi.org/10.1007/bf00223919
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.Keywords
This publication has 11 references indexed in Scilit:
- An efficient algorithm to compute the posterior genotypic distribution for every member of a pedigree without loopsTheoretical and Applied Genetics, 1993
- Two generations of selection on restricted best linear unbiased prediction breeding values for income minus feed cost in laying hens1Journal of Animal Science, 1992
- Evaluation of Likelihood Ratios for Complex Genetic ModelsMathematical Medicine and Biology: A Journal of the IMA, 1991
- Optimal Computation of Probability Functions for Pedigree AnalysisMathematical Medicine and Biology: A Journal of the IMA, 1986
- An approach to the multivariate analysis of high-density-lipoprotein cholesterol in a large kindred: The Bogalusa Heart StudyGenetic Epidemiology, 1986
- Extensions to Pedigree AnalysisHuman Heredity, 1982
- Pedigree analysis of Hodgkin's disease in a Newfoundland genealogyAnnals of Human Genetics, 1981
- Probability functions on complex pedigreesAdvances in Applied Probability, 1978
- Extensions to Pedigree AnalysisHuman Heredity, 1975
- A General Model for the Genetic Analysis of Pedigree DataHuman Heredity, 1971