next up previous
Next: Lander & Green Up: Overview of the Previous: Overview of the

Simple peeling (Elston & Stewart)

 

Algorithm complexity :

We saw last week how it is possible to condition the genotype probability for one individual so that it depends only on the genotypes of its closest relatives, allowing a sequential computation. Inbreeding complicates the computation, but not to the point of making it of exponential complexity. However, the sum runs over all possible joint genotypes at all the loci.



Simon Cawley
Thu Apr 16 15:30:12 PDT 1998