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

AUTOR(ES)

Abney, Mark

FONTE

Oxford University Press

RESUMO

Summary: 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.

Documentos Relacionados

• Identity Coefficients in Finite Populations. I. Evolution of Identity Coefficients in a Random Mating Diploid Dioecious Population
• Variances and covariances of identity coefficients of a multigene family.
• A fast random cost algorithm for physical mapping.
• A fast algorithm for computing the Hartley/ Fourier spectrum
• Fast-phase space computation of multiple arrivals