Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2649387.2649438acmconferencesArticle/Chapter ViewAbstractPublication PagesbcbConference Proceedingsconference-collections
research-article

IPED2: inheritance path based pedigree reconstruction algorithm for complicated pedigrees

Published: 20 September 2014 Publication History

Abstract

Reconstruction of family trees, or pedigree reconstruction, for a group of individuals is a fundamental problem in genetics. The problem is known to be NP-hard even for datasets known to only contain siblings. Some recent methods have been developed to accurately and efficiently reconstruct pedigrees. These methods, however, still consider relatively simple pedigrees, for example, they are not able to handle half-sibling situations where a pair of individuals only share one parent. In this work, we propose an efficient method, IPED2, based on our previous work, which specifically targets reconstruction of complicated pedigrees that include half-siblings. We note that the presence of half-siblings makes the reconstruction problem significantly more challenging which is why previous methods exclude the possibility of half-siblings. We proposed a novel model as well as an efficient graph algorithm and experiments show that our algorithm achieves relatively accurate reconstruction. To our knowledge, this is the first method that is able to handle pedigree reconstruction from genotype data when half-sibling exists in any generation of the pedigree.

References

[1]
G. Abecasis, S. Cherny, W. Cookson, L. Cardon, et al. Merlin-rapid analysis of dense genetic maps using sparse gene flow trees. Nature genetics, 30(1):97--101, 2002.
[2]
A. Albrechtsen, T. Sand Korneliussen, I. Moltke, T. van Overseem Hansen, F. Nielsen, and R. Nielsen. Relatedness mapping and tracts of relatedness for genome-wide data in the presence of linkage disequilibrium. Genetic epidemiology, 33(3):266--274, 2009.
[3]
D. Behar, S. Rosset, J. Blue-Smith, O. Balanovsky, S. Tzur, D. Comas, R. Mitchell, L. Quintana-Murci, C. Tyler-Smith, and R. Wells. The genographic project public participation mitochondrial dna database. PLoS Genetics, 3(6):e104, 2007.
[4]
C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575--577, 1973.
[5]
B. Browning and S. Browning. A fast, powerful method for detecting identity by descent. The American Journal of Human Genetics, 88(2):173--182, 2011.
[6]
G. Coop, X. Wen, C. Ober, J. Pritchard, and M. Przeworski. High-resolution mapping of crossovers reveals extensive variation in fine-scale recombination patterns among humans. Science, 319(5868):1395--1398, 2008.
[7]
K. Donnelly. The probability that related individuals share some section of genome identical by descent. Theoretical Population Biology, 23(1):34--63, 1983.
[8]
R. Elston and J. Stewart. A general model for the genetic analysis of pedigree data. Human heredity, 21(6):523--542, 1971.
[9]
M. Fishelson, N. Dovgolevsky, D. Geiger, et al. Maximum likelihood haplotyping for general pedigrees. Human Heredity, 59(1):41--60, 2005.
[10]
A. Gusev, J. Lowe, M. Stoffel, M. Daly, D. Altshuler, J. Breslow, J. Friedman, and I. Pe'er. Whole population, genome-wide mapping of hidden relatedness. Genome Research, 19(2):318--326, 2009.
[11]
D. He. Ibd-groupon: an efficient method for detecting group-wise identity-by-descent regions simultaneously in multiple individuals based on pairwise ibd relationships. Bioinformatics, 29(13):i162--i170, 2013.
[12]
D. He, Z. Wang, B. Han, L. Parida, and E. Eskin. Iped: Inheritance path based pedigree reconstruction algorithm using genotype data. In Research in Computational Molecular Biology, pages 75--87. Springer, 2013.
[13]
O. R. Jones and J. Wang. Colony: a program for parentage and sibship inference from multilocus genotype data. Molecular Ecology Resources, 10(3):551--555, 2010.
[14]
B. Kirkpatrick, S. Li, R. Karp, and E. Halperin. Pedigree reconstruction using identity by descent. In Research in Computational Molecular Biology, pages 136--152. Springer, 2011.
[15]
E. Lander and P. Green. Construction of multilocus genetic linkage maps in humans. Proceedings of the National Academy of Sciences, 84(8):2363, 1987.
[16]
X. Li, X. Yin, and J. Li. Efficient identification of identical-by-descent status in pedigrees with many untyped individuals. Bioinformatics, 26(12):i191--i198, 2010.
[17]
S. Ng, K. Buckingham, C. Lee, A. Bigham, H. Tabor, K. Dent, C. Huff, P. Shannon, E. Jabs, D. Nickerson, et al. Exome sequencing identifies the cause of a mendelian disorder. Nature genetics, 42(1):30--35, 2009.
[18]
W. Press. Wright-fisher models, approximations, and minimum increments of evolution. 2011.
[19]
S. Purcell, B. Neale, K. Todd-Brown, L. Thomas, M. Ferreira, D. Bender, J. Maller, P. Sklar, P. De Bakker, M. Daly, et al. Plink: a tool set for whole-genome association and population-based linkage analyses. The American Journal of Human Genetics, 81(3):559--575, 2007.
[20]
B. Servin, O. Martin, M. Mézard, et al. Toward a theory of marker-assisted gene pyramiding. Genetics, 168(1):513--523, 2004.
[21]
S. I. Sheikh, T. Y. Berger-Wolf, A. A. Khokhar, I. C. Caballero, M. V. Ashley, W. Chaovalitwongse, C.-A. Chou, and B. DasGupta. Combinatorial reconstruction of half-sibling groups from microsatellite data. Journal of Bioinformatics and Computational Biology, 8(02):337--356, 2010.
[22]
E. Sobel and K. Lange. Descent graphs in pedigree analysis: applications to haplotyping, location scores, and marker-sharing statistics. American journal of human genetics, 58(6):1323, 1996.
[23]
B. Thatte and M. Steel. Reconstructing pedigrees: A stochastic perspective. Journal of theoretical biology, 251(3):440--449, 2008.
[24]
E. Thompson. Pedigree analysis in human genetics. Johns Hopkins University Press Baltimore, MD, 1986.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
BCB '14: Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics
September 2014
851 pages
ISBN:9781450328944
DOI:10.1145/2649387
  • General Chairs:
  • Pierre Baldi,
  • Wei Wang
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 September 2014

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. dynamic programming
  2. graph algorithm
  3. half-sibling
  4. inheritance path
  5. pedigree reconstruction

Qualifiers

  • Research-article

Conference

BCB '14
Sponsor:
BCB '14: ACM-BCB '14
September 20 - 23, 2014
California, Newport Beach

Acceptance Rates

Overall Acceptance Rate 254 of 885 submissions, 29%

Upcoming Conference

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 57
    Total Downloads
  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Aug 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media