Difference between revisions of "Biostatistics 666: Applications of the Lander-Green Algorithm"
From Genome Analysis Wiki
Jump to navigationJump to search (Created page with '== Outline == This lecture outlines three useful applications of the inheritance vector concept that was first introduced in the Lander-Green algorithm. The applications are the…') |
|||
(One intermediate revision by the same user not shown) | |||
Line 9: | Line 9: | ||
== References == | == References == | ||
− | Kruglyak, Daly, Reeve-Daly | + | Kruglyak, Daly, Reeve-Daly and Lander (1996) ''Am J Hum Genet'' '''58''':1347-63 |
− | McPeek (1999) Genetic Epidemiology 16:225–249 | + | Kong and Cox (1997) ''Am J Hum Genet'' '''61''':1179-88 |
+ | |||
+ | McPeek (1999) ''Genetic Epidemiology'' '''16''':225–249 | ||
+ | |||
+ | Whittemore and Halpern (1994) ''Biometrics'' '''50''':118-27. |
Latest revision as of 23:13, 7 April 2010
Outline
This lecture outlines three useful applications of the inheritance vector concept that was first introduced in the Lander-Green algorithm. The applications are the calculation of parametric and non-parametric linkage statistics, and information content calculations.
Class Notes
References
Kruglyak, Daly, Reeve-Daly and Lander (1996) Am J Hum Genet 58:1347-63
Kong and Cox (1997) Am J Hum Genet 61:1179-88
McPeek (1999) Genetic Epidemiology 16:225–249
Whittemore and Halpern (1994) Biometrics 50:118-27.