arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1408.5530cs.DSq-bio.PE
收藏

IPED2:基于继承路径的复杂谱系重构算法

IPED2: Inheritance Path based Pedigree Reconstruction Algorithm for Complicated Pedigrees

Dan He, Zhanyong Wang, Laxmi Parida, Eleazar Eskin

摘要:

重建一组个体的家谱或系谱重建是遗传学中的一个基本问题。即使对于已知只包含兄弟的数据集,这个问题也是NP难的。最近的一些方法已经发展到准确和有效地重建谱系。然而,这些方法仍然考虑相对简单的谱系,例如,它们不能处理一对个体仅共享一个父母的半同胞情况。在这项工作中,我们提出了一个有效的方法,IPED 2,基于我们以前的工作,它专门针对重建复杂的谱系,包括半同胞。我们注意到,半同胞的存在使得重建问题更具挑战性,这就是为什么以前的方法排除了半同胞的可能性。我们提出了一种新的模型,以及一个有效的图算法和实验表明,我们的算法实现了相对准确的重建。据我们所知,这是第一个方法,能够处理系谱重建的基因型数据的基础上,只有当半同胞存在于任何一代的系谱。

英文摘要:

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 based on genotype data only when half-sibling exists in any generation of the pedigree.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑