Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
BIOINFORMATICS APPLICATIONS NOTE Vol. 25 no. 12 2009, pages 15611563
 

Summary: BIOINFORMATICS APPLICATIONS NOTE
Vol. 25 no. 12 2009, pages 15611563
doi:10.1093/bioinformatics/btp185
Genetics and population analysis
A graphical algorithm for fast computation of identity
coefficients and generalized kinship coefficients
Mark Abney
Department of Human Genetics, University of Chicago, 920 E 58th St., Chicago, IL 60637, USA
Received on February 12, 2009; revised on March 30, 2009; accepted on March 31, 2009
Advance Access publication April 9, 2009
Associate Editor: Martin Bishop
ABSTRACT
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.

  

Source: Abney, Mark - Department of Human Genetics, University of Chicago

 

Collections: Computer Technologies and Information Sciences; Biology and Medicine