A graphical algorithm for fast computation of identity coefficients and generalized kinship coefficients

Abstract

Computing the probability of identity by descent sharing among n genes given only the pedigree of those genes is a computationally challenging problem, if n or the pedigree size is large. Here, I present a novel graphical algorithm for efficiently computing all generalized kinship coefficients for n genes. The graphical description transforms the problem from doing many recursion on the pedigree to doing a single traversal of a structure referred to as the kinship graph. © The Author 2009. Published by Oxford University Press. All rights reserved.