arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.08647cs.LGcs.ITmath.ITq-bio.QMstat.ML
收藏

单个个体单体型分析的矩阵完成和性能保证

Matrix Completion and Performance Guarantees for Single Individual Haplotyping

The University of Texas at Austin(德克萨斯大学奥斯汀分校)

Somsubhra Barik, Haris Vikalo

摘要:

单个体单倍型分析是一个NP难题,当试图使用通常由高通量DNA测序平台生成的数据重建生物体的遗传变异时出现。包括人类在内的二倍体生物体的基因组被组织成同源染色体对,这些染色体对在相对少量的变异位置上彼此不同。单倍型是同源对中染色体的变异位置中的核苷酸的有序序列;对于二倍体,与一对染色体相关的单倍型可以方便地通过互补二元序列表示。在本文中,我们考虑了一个二元矩阵分解制定的单个体单倍型问题,并有效地解决它的交替最小化。我们分析了交替最小化算法的收敛特性,并建立了理论界可实现的单倍型重建误差。所提出的技术被证明优于现有的方法时,应用于合成以及现实世界的Fosmid为基础的HapMap NA 12878数据集。

英文摘要:

Single individual haplotyping is an NP-hard problem that emerges when attempting to reconstruct an organism's inherited genetic variations using data typically generated by high-throughput DNA sequencing platforms. Genomes of diploid organisms, including humans, are organized into homologous pairs of chromosomes that differ from each other in a relatively small number of variant positions. Haplotypes are ordered sequences of the nucleotides in the variant positions of the chromosomes in a homologous pair; for diploids, haplotypes associated with a pair of chromosomes may be conveniently represented by means of complementary binary sequences. In this paper, we consider a binary matrix factorization formulation of the single individual haplotyping problem and efficiently solve it by means of alternating minimization. We analyze the convergence properties of the alternating minimization algorithm and establish theoretical bounds for the achievable haplotype reconstruction error. The proposed technique is shown to outperform existing methods when applied to synthetic as well as real-world Fosmid-based HapMap NA12878 datasets.

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

↑