Lander–Green algorithm: Difference between revisions

Content deleted Content added
m Disambiguate Pedigree to Pedigree chart using popups
Added two references
Line 1:
The '''Lander–Green algorithm''' is an algorithm, due to [[Eric Lander]] and [[Philip Green (geneticist)| Philip Green]] for computing the [[likelihood]] of observed genotype data given a [[Pedigree chart|pedigree]]. It is appropriate for relatively small pedigrees and a large number of markers. It is used in the analysis of [[genetic linkage]].<ref name="Lander and Green (1987)"> Lander and Green (1987)
PNAS 84:2363-7
</ref>
<ref name="Abecasis 2005">
Handling Marker-Marker Linkage Disequilibrium: Pedigree Analysis with Clustered Markers
[http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1271385/]
</ref>
 
[[Category:Genetic epidemiology]]
Line 11 ⟶ 17:
 
[[zh:Lander–Green算法]]
 
 
Lander and Green (1987)
PNAS 84:2363-7
 
 
 
<references/>