arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.04270cs.DS
收藏

少数家系的单倍型推断

Haplotype Inference for Pedigrees with Few Recombinations

Bonnie Kirkpatrick

摘要:

系谱,或家庭树,是用来研究遗传的家庭关系图。计算生物学中的一个基本问题是,对于每个位点都有基因分型的$n$个体的系谱,找到一组具有最少重组次数的孟德尔一致单倍型。这是一个NP难问题,一些谱系可能有数千个个体和数十万个站点。本文将此问题表述为一个图上的优化问题,并引入了一个定制的算法,对于n个个体,m个站点和k个重组,运行时间为O(n^{(k+2)}m^{6 k})。由于在每次减数分裂中每个染色体通常只有1-2次重组,k足够小以使该算法实际上相关。

英文摘要:

Pedigrees, or family trees, are graphs of family relationships that are used to study inheritance. A fundamental problem in computational biology is to find, for a pedigree with $n$ individuals genotyped at every site, a set of Mendelian-consistent haplotypes that have the minimum number of recombinations. This is an NP-hard problem and some pedigrees can have thousands of individuals and hundreds of thousands of sites. This paper formulates this problem as a optimization on a graph and introduces a tailored algorithm with a running time of O(n^{(k+2)}m^{6k}) for n individuals, m sites, and k recombinations. Since there are generally only 1-2 recombinations per chromosome in each meiosis, k is small enough to make this algorithm practically relevant.

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

↑