Journal Article

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

Mark Abney

in Bioinformatics

Volume 25, issue 12, pages 1561-1563
Published in print June 2009 | ISSN: 1367-4803
Published online April 2009 | e-ISSN: 1460-2059 | DOI: http://dx.doi.org/10.1093/bioinformatics/btp185
A graphical algorithm for fast computation of identity coefficients and generalized kinship coefficients

Show Summary Details

Preview

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.

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.

Journal Article.  2068 words. 

Subjects: Bioinformatics and Computational Biology

Full text: subscription required

How to subscribe Recommend to my Librarian

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.