Counting methods (EM algorithm) in human pedigree analysis: Linkage and segregation analysis
SUMMARY 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 a...
Saved in:
| Published in | Annals of human genetics Vol. 40; no. 4; pp. 443 - 454 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Oxford, UK
Blackwell Publishing Ltd
01.01.1977
|
| Online Access | Get full text |
| ISSN | 0003-4800 1469-1809 |
| DOI | 10.1111/j.1469-1809.1977.tb01862.x |
Cover
| Summary: | SUMMARY
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 pedigrees 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). |
|---|---|
| ISSN: | 0003-4800 1469-1809 |
| DOI: | 10.1111/j.1469-1809.1977.tb01862.x |