Jump to content

Lander–Green algorithm

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Melcombe (talk | contribs) at 09:30, 2 August 2010 (add detail for citation). 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, 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. ^ Handling Marker-Marker Linkage Disequilibrium: Pedigree Analysis with Clustered Markers [1]
Stub icon

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

Stub icon

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=376729877"