A graphical algorithm for fast computation of identity coefficients and generalized kinship coefficients
- PMID: 19359355
- PMCID: PMC2687941
- DOI: 10.1093/bioinformatics/btp185
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.
Availability: The algorithm is implemented for n = 4 in the software package IdCoefs at http://home.uchicago.edu/abney/Software.html.
Contact: abney@bsd.uchicago.edu
Supplementary information: Supplementary data are available at Bioinformatics online.
References
-
- Angius A, et al. Patterns of linkage disequilibrium between SNPs in a sardinian population isolate and the selection of markers for association studies. Hum. Hered. 2008;65:9–22. - PubMed
-
- Cheng E, et al. Scalable computation of kinship and identity coefficients on large pedigrees. In: Markstein P, Xu Y, editors. Proceedings of the Computational Systems Bioinformatics 2008 Conference. Vol. 7. London: Imperial College Press; 2008. pp. 27–36. - PubMed
-
- Gillois M. La relation d'identité en génétique. Ann. Inst. Henri Poincaré B. 1964;2:1–94.
Publication types
MeSH terms
Grants and funding
LinkOut - more resources
Full Text Sources
Other Literature Sources