Kirkpatrick Bonnie, Halperin Eran, Karp Richard M
Computer Science Department, University of California, Berkeley, California 94720-1776, USA.
J Comput Biol. 2010 Mar;17(3):269-80. doi: 10.1089/cmb.2009.0174.
Despite the desirable information contained in complex pedigree data sets, analysis methods struggle to efficiently process these data. The attractiveness of pedigree data is their power for detecting rare variants, particularly in comparison with studies of unrelated individuals. In addition, rather than assuming individuals in a study are unrelated, knowledge of their relationships can avoid spurious results due to confounding population structure effects. However, a major challenge for applying pedigree methods is difficulty in handling complex pedigrees having multiple founding lineages, inbreeding, and half-sibling relationships. A key ingredient in association studies is imputation and inference of haplotypes from genotype data. Existing haplotype inference methods either do not efficiently scale to complex pedigrees or are of limited accuracy. In this article, we present algorithms for efficient haplotype inference and imputation in complex pedigrees. Our method, PhyloPed, leverages the perfect phylogeny model, resulting in an efficient method with high accuracy. PhyloPed effectively combines the founder haplotype information from different lineages and is immune to inaccuracies in prior information about the founders. In addition, we demonstrate that inference of missing data, using PhyloPed, can substantially improve disease association. For Online Supplementary Material, see www.liebertonline.com.
尽管复杂家系数据集中包含了有价值的信息,但分析方法在有效处理这些数据时仍面临困难。家系数据的吸引力在于其检测罕见变异的能力,特别是与无关个体的研究相比。此外,了解个体之间的关系而非假设研究中的个体无关,可以避免由于混杂的群体结构效应导致的虚假结果。然而,应用家系方法的一个主要挑战是难以处理具有多个创始谱系、近亲繁殖和半同胞关系的复杂家系。关联研究中的一个关键要素是从基因型数据中推断和估算单倍型。现有的单倍型推断方法要么不能有效地扩展到复杂家系,要么准确性有限。在本文中,我们提出了在复杂家系中进行高效单倍型推断和估算的算法。我们的方法PhyloPed利用了完美系统发育模型,从而得到了一种高效且准确的方法。PhyloPed有效地结合了来自不同谱系的创始单倍型信息,并且不受创始者先验信息不准确的影响。此外,我们证明,使用PhyloPed推断缺失数据可以显著改善疾病关联。在线补充材料见www.liebertonline.com。