基于de Bruijn图的序列拼接算法研究与实现  

Research & Implementation of Sequence Assembly Algorithm Based on de Bruijn Graphs

作　　者：李飞菲[1] 

机构地区：[1]四川大学计算机学院,四川610065

出　　处：《现代计算机（中旬刊）》2016年第1期3-6,25,共5页Modern Computer

摘　　要：序列拼接算法是DNA测序过程中的关键技术。随着新一代测序技术的发展,如何实现高通量、高效率测序已经成为生物信息学领域的重要挑战,序列拼接算法也在逐渐改进以提高拼接效果。基于de Bruijn图的序列拼接算法是目前使用最广泛的方法之一,对其进行分析研究,利用C++编程实现该算法,并对实验结果进行分析。Algorithms for DNA sequence assembly are the key process of gene sequencing. With the development of next-generation sequencing technologies, how to achieve high-throughput, high-efficiency sequencing has become an important challenge in bioinformatics. At the same time, sequence assembly algorithms also have been improved to get better results. The algorithms based on de Bruijn graph are the most popular DNA sequence assembly algorithm, analyses and researches on it, applies C＋＋ language to program this algorithm, and anal- yses the experiment results.

关 键 词：新一代测序技术 高通量测序 基因拼接 DE BRUIJN图 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]