The recursive derivation of likelihoods on complex pedigrees
Advances in Applied ProbabilityPublished 1 December 1976
C. Cannings, E. A. Thompson, H. H. Skolnick
Citations43
SJR quartileQ2
SJR score0.65
SNIP1.12
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
By generalizing the recursion so that information on individuals can be collapsed onto an offspring the authors allow pedigrees in which there are no loops (zero-loop), and by introducing the notion of collapsing information onto a set of individuals jointly, the method is extended to pedigree of arbitrary complexity.
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Keywords
Mathematics
Human HeredityExtensions to Pedigree Analysis
334 Citations1975Kenneth Lange, R.C. Elston
A computer method for calculating recurrence under the polygenic threshold model permits accurate risk evaluation for pedigrees of arbitrary structure and large enough size.