面向新一代基因测序数据的拼接算法综述

Survey on assembly algorithms for next generation sequencing

针对新一代DNA测序数据存在reads长度短、高覆盖度且存在错误数据等特点,研发满足实际应用的拼接软件,是序列拼接领域迫切的研究课题。探讨了全基因组序列拼接面临的挑战,研究了主流的几类拼接算法的拼接原理、操作流程,分析各种算法的优缺点和适用范围,其中包括基于贪心图算法、基于OLC图算法、基于De Bruijn图算法等,并根据不同的标准列举了几类拼接算法之间的差异性,最后对基因拼接算法在未来的研究给出了建议。

On condition that next genome sequencing data typically suffers shorter read lengths, high coverage, and different error profiles, development of the sequencing assembly software that could meet practical application has become the most important research topic. This paper analysed the challenges of whole genome assembly, the main strategies of assembly, the steps, the advantages and disadvantages of each algorithms as well as the scope of application, including the graph algorithms based on the greedy, OLC, De Bruijn and so on. On the basis of the principles of different algorithms, the paper gave the comparing results between the various strategies depending on the different standard. Finally, it discussed the feature research recommendations of genome assembly.