Vu Tien Khang J
Institut National de la Recherche Agronomique, Centre de Recherche de Toulouse, Castanet-Tolosan, France.
Comput Appl Biosci. 1989 Jul;5(3):199-204. doi: 10.1093/bioinformatics/5.3.199.
This paper presents a FORTRAN IV subroutine to calculate inbreeding and kinship coefficients from pedigree information in a diploid population without self-fertilization. The user can specify the number of ancestral generations to be taken into account. It is thus possible to determine contributions of succeeding ancestral generations to the inbreeding and kinship coefficients under consideration. The subroutine is based on a recursive procedure that generates systematically all paths connecting two individuals. NP and NM, whose kinship coefficient is to be calculated (or between the father NP and the mother NM of the individual whose inbreeding coefficient is to be calculated). These paths obey the following conditions: (i) a given path does not contain the same parent-offspring link more than once; (ii) the vertex of a path is an ancestor common to individuals NP and NM, with a rank lower or equal to the parameter specified in input. Constraints regarding the size of the corpus of genealogical data and the storage method are discussed, as well as the interest of this subroutine compared to the existing ones. An example of application is given.
本文介绍了一个FORTRAN IV子程序，用于在无自体受精的二倍体群体中根据系谱信息计算近亲繁殖系数和亲属系数。用户可以指定要考虑的祖先代数。因此，可以确定后续祖先代对所考虑的近亲繁殖系数和亲属系数的贡献。该子程序基于一种递归过程，该过程系统地生成连接两个个体（其亲属系数要被计算的个体NP和NM，或者要计算近亲繁殖系数的个体的父亲NP和母亲NM）的所有路径。这些路径遵循以下条件：（i）给定路径不包含超过一次的相同亲子链接；（ii）路径的顶点是个体NP和NM的共同祖先，其等级低于或等于输入中指定的参数。讨论了关于家谱数据体量大小和存储方法的限制，以及与现有子程序相比该子程序的优势。给出了一个应用示例。
