A graphical algorithm for fast computation of identity coefficients and generalized kinship coefficients
A graphical algorithm for fast computation of identity coefficients and generalized kinship coefficients
复制标题
DOI：
10.1093/bioinformatics/btp185
复制
发表时间：
2009-06-15
期刊：
影响因子：
5.8
通讯作者：
Abney, Mark
中科院分区：
文献类型：
--
作者：
Abney, Mark
如果n或系谱的大小是大的，则仅给定那些基因的系谱，通过在n个基因之间的下降共享来计算同一性的概率是计算上具有挑战性的问题。在这里，我提出了一种新的图形算法，有效地计算所有广义亲缘系数n个基因。图形描述将问题从在谱系上进行多次递归转换为对称为亲属关系图的结构进行单次遍历。
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.