Lander–Green algorithm
From Wikipedia, the free encyclopedia
See also: Elston–Stewart algorithm
The Lander–Green algorithm is an algorithm, due to Eric Lander and Philip Green for computing the likelihood of observed genotype data given a pedigree. It is appropriate for relatively small pedigrees and a large number of markers. It is used in the analysis of genetic linkage.[1] [2]
References
[edit ]- ^ Lander, E.S. and Green, P. (1987) "Construction of multilocus genetic linkage maps in humans", Proceedings of the National Academy of Sciences, 84 (8), 2363–2367
- ^ Abecasis, G.R., Wigginton, J.E. (2005) "Handling Marker-Marker Linkage Disequilibrium: Pedigree Analysis with Clustered Markers", Am J Hum Genet., 77(5), 754–767.
Stub icon
This statistics-related article is a stub. You can help Wikipedia by expanding it.