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.
We don't have any images related to Lander–Green algorithm yet.
You can add one yourself here.
We don't have any YouTube videos related to Lander–Green algorithm yet.
You can add one yourself here.
We don't have any PDF documents related to Lander–Green algorithm yet.
You can add one yourself here.
We don't have any Books related to Lander–Green algorithm yet.
You can add one yourself here.
We don't have any archived web articles related to Lander–Green algorithm yet.
References
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 http://www.pnas.org/content/84/8/2363.full.pdf ↩
Abecasis, G.R., Wigginton, J.E. (2005) "Handling Marker-Marker Linkage Disequilibrium: Pedigree Analysis with Clustered Markers", Am J Hum Genet., 77(5), 754–767. https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1271385/ ↩