• DocumentCode
    3196104
  • Title

    IPEDX: An exact algorithm for pedigree reconstruction using genotype data

  • Author

    Dan He ; Eskin, Eleazar

  • Author_Institution
    IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA
  • fYear
    2013
  • fDate
    18-21 Dec. 2013
  • Firstpage
    517
  • Lastpage
    520
  • Abstract
    The problem of inference of family trees, or pedigree reconstruction, for a group of individuals has attracted lots of attentions recently. Various methods have been proposed to automate the process of pedigree reconstruction given the genotypes or haplotypes of a set of individuals. The state-of-the-art method IPED is able to reconstruct large pedigrees with reasonable accuracy. However, the algorithm is shown to be an approximate algorithm. In this work, we proposed an exact method IPEDX, where two dynamic programming algorithms are developed to compute inheritance paths between ancestors and descendants as well as exact paths between extant individuals, respectively. Then IPEDX reconstructs the pedigrees utilizing the outputs of the two algorithms. Experiments show that as an exact algorithm, IPEDX generally achieves better results than IPED does. It does require longer computation time but is still very efficient for pedigrees which have a large number of generations.
  • Keywords
    bioinformatics; dynamic programming; genetics; inference mechanisms; IPEDX; approximate algorithm; dynamic programming algorithms; exact algorithm; family tree inference; genotype data; inheritance paths; pedigree reconstruction; Accuracy; Approximation algorithms; Approximation methods; Bioinformatics; Error analysis; Genetics; Heuristic algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Bioinformatics and Biomedicine (BIBM), 2013 IEEE International Conference on
  • Conference_Location
    Shanghai
  • Type

    conf

  • DOI
    10.1109/BIBM.2013.6732549
  • Filename
    6732549