arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1403.5686q-bio.GNcs.CEcs.ITmath.IT
收藏

参考引导DNA序列拼接的迭代学习算法及性能限制

Iterative Learning for Reference-Guided DNA Sequence Assembly from Short Reads: Algorithms and Limits of Performance

Xiaohu Shen, Manohar Shamaiah, Haris Vikalo

摘要:

最近出现的下一代DNA测序技术使得能够以前所未有的规模获取遗传信息。为了确定生物体的遗传蓝图,测序平台通常采用所谓的鸟枪测序策略,用相对短的重叠读段的文库对靶基因组进行过采样。通过处理由测序仪器产生的所获取的噪声信号来确定读段中的核苷酸的顺序。即使在存在参考基因组的情况下,从潜在错误的短读段组装基因组也是计算上令人生畏的任务。参考中的错误和缺口以及靶中的完美重复区域进一步使得组装具有挑战性并导致不准确性。在本文中,我们制定的参考引导序列组装问题的二分图上的基因组序列的推理,并解决它使用的消息传递算法。该算法可以被解释为著名的经典的信念传播计划在一定的先验。与现有的最先进的方法不同,所提出的算法结合了由读段提供的信息,而不需要知道短读段的可靠性(所谓的质量分数)。讨论了消息传递算法与可证收敛幂迭代格式的关系。为了评估和基准所提出的技术的性能,我们找到了一个天才辅助最大后验概率(MAP)决策方案的错误概率的解析表达式。仿真和实验数据的结果表明,所提出的消息传递算法优于常用的最先进的工具,它几乎达到上述MAP决策方案的性能。

英文摘要:

Recent emergence of next-generation DNA sequencing technology has enabled acquisition of genetic information at unprecedented scales. In order to determine the genetic blueprint of an organism, sequencing platforms typically employ so-called shotgun sequencing strategy to oversample the target genome with a library of relatively short overlapping reads. The order of nucleotides in the reads is determined by processing the acquired noisy signals generated by the sequencing instrument. Assembly of a genome from potentially erroneous short reads is a computationally daunting task even in the scenario where a reference genome exists. Errors and gaps in the reference, and perfect repeat regions in the target, further render the assembly challenging and cause inaccuracies. In this paper, we formulate the reference-guided sequence assembly problem as the inference of the genome sequence on a bipartite graph and solve it using a message-passing algorithm. The proposed algorithm can be interpreted as the well-known classical belief propagation scheme under a certain prior. Unlike existing state-of-the-art methods, the proposed algorithm combines the information provided by the reads without needing to know reliability of the short reads (so-called quality scores). Relation of the message-passing algorithm to a provably convergent power iteration scheme is discussed. To evaluate and benchmark the performance of the proposed technique, we find an analytical expression for the probability of error of a genie-aided maximum a posteriori (MAP) decision scheme. Results on both simulated and experimental data demonstrate that the proposed message-passing algorithm outperforms commonly used state-of-the-art tools, and it nearly achieves the performance of the aforementioned MAP decision scheme.

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

↑