Content deleted Content added
m robot Removing: zh:Lander–Green算法 |
KolbertBot (talk | contribs) m Bot: HTTP→HTTPS |
||
(2 intermediate revisions by 2 users not shown) | |||
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, E.S. and Green, P. (1987) [http://www.pnas.org/content/84/8/2363.full.pdf "Construction of multilocus genetic linkage maps in humans"], ''Proceedings of the National Academy of Sciences'', 84 (8), 2363–2367</ref><ref name="Abecasis 2005">▼
Abecasis, G.R., Wigginton, J.E. (2005) [http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1271385/ "Handling Marker-Marker Linkage Disequilibrium: Pedigree Analysis with Clustered Markers"], ''Am J Hum Genet.'', 77(5), 754–767.▼
</ref>▼
{{See also| Elston–Stewart algorithm}}
▲The '''Lander–Green algorithm''' is an algorithm, due to [[Eric Lander]] and [[Philip Green (geneticist)|
▲Abecasis, G.R., Wigginton, J.E. (2005) [
▲</ref>
==References==
<references/>
{{DEFAULTSORT:Lander-Green algorithm}}
[[Category:Genetic epidemiology]]
[[Category:Statistical genetics]]
[[Category:Genetic linkage analysis]]
[[Category:Statistical algorithms]]
{{genetics-stub}}
|