Lange K, Elston R C
Hum Hered. 1975;25(2):95-105. doi: 10.1159/000152714.
A graph theoretic definition of pedigrees is given and a distinction drawn between simple and complex pedigrees. Algorithms are presented to calculate the likeihood of any kind of pedigree, assuming only segregation at a finite set of loci, nonassortative mating and no environmental correlations; multiple births and consanguineous marriages are explicity allowed for. The formulation given can lead to more powerful genetic counselling, segregation analysis and linkage analysis.
给出了系谱的图论定义,并区分了简单系谱和复杂系谱。提出了算法,用于计算任何类型系谱的似然性,假设仅在有限的基因座集上发生分离、非选型交配且无环境相关性;明确允许多胎生育和近亲结婚。所给出的公式可用于更有效的遗传咨询、分离分析和连锁分析。