Jump to content

Lander–Green algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by JL-Bot (talk | contribs) at 03:11, 25 August 2009 (removing non-applicable orphan template). 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.