Counting methods (EM algorithm) in human pedigree analysis: Linkage and segregation analysis
Jürg Ott · Annals of Human Genetics · 1977
The likelihood of human pedigree data can be written in such a form as to allow the computation of derivatives. This is done for various parameters in linkage and segregation analysis. The equations for the maximum likelihood estimates are represented in a particularly appealing form which allows iterative solutions. This process is an extension to pedigress of Smith's (1957) counting methods. All these procedures belong to a general class of MLE methods for incomplete data called EM algorithms (Dempster et al. 1976).
Cited by 68 works. doi:10.1111/j.1469-1809.1977.tb01862.x
Authors
References
- A First Course in Numerical Analysis
- A General Model for the Genetic Analysis of Pedigree Data
- Estimation of the recombination fraction in human pedigrees: efficient computation of the likelihood for human linkage studies.
- Journal of the Royal Statistical Society (B)
- Extensions to Pedigree Analysis
- The American Journal of Human Genetics
- Estimating the Components of a Mixture of Normal Distributions
- Estimation of Parameters for a Mixture of Normal Distributions
- A computer program for linkage analysis of general human pedigrees.
- THE ESTIMATION OF GENE FREQUENCIES IN A RANDOM‐MATING POPULATION