Pedigree reconstruction using identity by descent.
Can we find the family trees, or pedigrees, that relate the haplotypes of a group of individuals? Collecting the genealogical information for how individuals are related is a very time-consuming and expensive process. Methods for automating the construction of pedigrees could stream-line this process. While constructing single-generation families is relatively easy given whole genome data, reconstructing multi-generational, possibly inbred, pedigrees is much more challenging. This article addresses the important question of reconstructing monogamous, regular pedigrees, where pedigrees are regular when individuals mate only with other individuals at the same generation. This article introduces two multi-generational pedigree reconstruction methods: one for inbreeding relationships and one for outbreeding relationships. In contrast to previous methods that focused on the independent estimation of relationship distances between every pair of typed individuals, here we present methods that aim at the reconstruction of the entire pedigree. We show that both our methods out-perform the state-of-the-art and that the outbreeding method is capable of reconstructing pedigrees at least six generations back in time with high accuracy. The two programs are available at http://cop.icsi.berkeley.edu/cop/.
Electrical Engineering and Computer Sciences, University of California, Berkeley, California 94720, USA. bbkirk@eecs.berkeley.edu
Bonnie
B
Kirkpatrick
Shuai Cheng
SC
Li
Richard M
RM
Karp
Eran
E
Halperin
D000465:Algorithms; D003198:Computer Simulation; D003241:Consanguinity; D006239:Haplotypes; D006801:Humans; D008957:Models, Genetic; D010375:Pedigree; D016012:Poisson Distribution; D011995:Recombination, Genetic; D017422:Sequence Analysis, DNA