Wikipedia

Lander–Green algorithm

This is an old revision of this page, as edited by Melcombe (talk | contribs) at 09:23, 2 August 2010 (tidy to order of sections). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

See also: Elston–Stewart algorithm

References

  1. ^ Lander and Green (1987) PNAS 84:2363-7
  2. ^ Handling Marker-Marker Linkage Disequilibrium: Pedigree Analysis with Clustered Markers [1]
 

This genetics article is a stub. You can help Wikipedia by expanding it.

 

This statistics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Lander–Green_algorithm&oldid=376729247"