Lander–Green algorithm explained

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

  1. 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
  2. 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.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Lander–Green algorithm".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.