首页> 外文会议>Asia-Pacific Bioinformatics Conference >Efficient algorithms for polyploid haplotype phasing
【24h】

Efficient algorithms for polyploid haplotype phasing

机译:多倍体单倍型定相的高效算法

获取原文

摘要

Background: Inference of haplotypes, or the sequence of alleles along the same chromosomes, is a fundamental problem in genetics and is a key component for many analyses including admixture mapping, identifying regions of identity by descent and imputation. Haplotype phasing based on sequencing reads has attracted lots of attentions. Diploid haplotype phasing where the two haplotypes are complimentary have been studied extensively. In this work, we focused on Polyploid haplotype phasing where we aimto phase more than two haplotypes at the same time from sequencing data. The problem is much more complicated as the search space becomes much larger and the haplotypes do not need to be complimentary any more.Results: We proposed two algorithms, (1) Poly-Harsh, a Gibbs Sampling based algorithm which alternatively samples haplotypes and the read assignments to minimize the mismatches between the reads and the phased haplotypes, (2) An efficient algorithm to concatenate haplotype blocks into contiguous haplotypes.Conclusions: Our experiments showed that our method is able to improve the quality of the phased haplotypes over the state-of-the-art methods. To our knowledge, our algorithm for haplotype blocks concatenation is the first algorithm that leverages the shared information across multiple individuals to construct contiguous haplotypes. Our experiments showed that it is both efficient and effective.
机译:背景:单倍型的推理,或沿相同的染色体等位基因的序列,是在遗传学的一个基本问题,并且是许多分析包括混合映射,通过下降和插补识别身份的区域中的关键组成部分。基于测序单倍体逐步读取吸引了很多关注的。二倍体单倍型相位,其中两个单倍型是互补的已被广泛研究。在这项工作中,我们将重点放在高倍单倍型相位,其中从测序数据同时我们aimto阶段两个以上的单倍型。这个问题要复杂得多的搜索空间变得更大,单倍型并不需要是免费的任何more.Results:我们提出了两种算法:(1)聚苛刻,基于Gibbs采样算法或者样品单倍型和读取分配,以最小化失配之间的读取和分阶段的单倍型,(2)一种有效的算法来连接的单倍型块到连续haplotypes.Conclusions:我们的实验表明,我们的方法能够提高在所述状态 - 分阶段的单倍型的质量的最先进的方法。据我们所知,我们的单倍型块拼接算法是第一种算法,充分利用跨多个人共享信息来构建连续的单倍型。我们的实验表明,它是既高效又有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号