Lander–Green algorithm
Encyclopedia
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
.
Eric Lander
Eric Steven Lander is a Professor of Biology at the Massachusetts Institute of Technology , a member of the Whitehead Institute, and director of the Broad Institute of MIT and Harvard who has devoted his career toward realizing the promise of the human genome for medicine. He is co-chair of U.S...
and Philip Green for computing the likelihood
Likelihood
Likelihood is a measure of how likely an event is, and can be expressed in terms of, for example, probability or odds in favor.-Likelihood function:...
of observed genotype data given a pedigree
Pedigree chart
A pedigree chart is a diagram that shows the occurrence and appearance or phenotypes of a particular gene or organism and its ancestors from one generation to the next, most commonly humans, show dogs, and race horses....
. It is appropriate for relatively small pedigrees and a large number of markers. It is used in the analysis of genetic linkage
Genetic linkage
Genetic linkage is the tendency of certain loci or alleles to be inherited together. Genetic loci that are physically close to one another on the same chromosome tend to stay together during meiosis, and are thus genetically linked.-Background:...
.