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 paper 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 paper 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.
KeywordsRandom Walk Sibling Relationship Reconstruction Accuracy Ancestral Haplotype Shared Region
Unable to display preview. Download preview PDF.
- 7.Browning, S.R., Briley, J.D., Briley, L.P., Chandra, G., Charnecki, J.H., Ehm, M.G., Johansson, K.A., Jones, B.J., Karter, A.J., Yarnall, D.P., Wagner, M.J.: Case-control single-marker and haplotypic association analysis of pedigree data. Genetic Epidemiology 28(2), 110–122 (2005)CrossRefGoogle Scholar
- 15.Karp, R.M., Li, S.C.: An efficient method for quasi-cliques partition (2011) (manuscript in preparation)Google Scholar
- 17.Kirkpatrick, B.: Pedigree reconstruction using identity by descent. Class project, Prof. Yun Song, 2008. Technical Report No. UCB/EECS-2010-43 (2010)Google Scholar
- 18.Kirkpatrick, B., Reshef, Y., Finucane, H., Jiang, H., Zhu, B., Karp, R.M.: Algorithms for comparing pedigree graphs. CoRR, abs/1009.0909 (2010)Google Scholar
- 21.Li, J., Jiang, T.: An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming. In: Proceedings of the 7th Annual International Conference on Research in Computational Molecular Biology, pp. 101–110 (2003)Google Scholar
- 23.McPeek, M.S., Speed, T.P.: Modeling interference in genetic recombination. Genetics 139(2), 1031–1044 (1995)Google Scholar
- 29.Sheikh, S.I., Berger-wolf, T.Y., Khokhar, A.A., Caballero, I.C., Ashley, M.V., Chaovalitwongse, W., Chou, C., Dasgupta, B.: Combinatorial reconstruction of half-sibling groups from microsatellite data. In: 8th International Conference on Computational Systems Bioinformatics (CSB) (2009)Google Scholar
- 30.Sobel, E., Lange, K.: Descent graphs in pedigree analysis: Applications to haplotyping, location scores, and marker-sharing statistics. American Journal of Human Genetics 58(6), 1323–1337 (1996)Google Scholar
- 33.Thatte, B.D.: Combinatorics of pedigrees (2006)Google Scholar
- 35.Thompson, E.A.: Pedigree Analysis in Human Genetics. Johns Hopkins University Press, Baltimore (1985)Google Scholar