计算机工程与科学2017，Vol.39Issue(9)：1610-1616,7.DOI:10.3969/j.issn.1007-130X.2017.09.005
一种基于蚁群算法的生物序列并行比对方法
A parallel alignment method for biological sequences based on ant colony algorithm
摘要
Abstract
Biological sequence alignment is an important issue in the field of bioinformatics,and the rationality and correctness of alignment results are crucial to the researches based on sequence alignment.It is of great significance to exploit the computational potential with the help of parallel computing to improve alignment efficiency under the premise of ensuring alignment correctness.We propose a parallel alignment scheme based on the ant colony algorithm for the global sequences alignment problem.Aiming at the two most time-consuming steps in the ant colony algorithm,the search of comparison path and the pheromone update,we present a parallel method based on the shared memory model.Experiments on Tianhe Ⅱ by the OpenMP show that with eight threads in parallel,the speedup can achieve 5.03,and the longer the sequence is,the better the performance is.关键词
生物序列比对/并行算法/蚁群算法/OpenMPKey words
biological sequence alignment/parallel algorithm/ant colony algorithm/OpenMP分类
信息技术与安全科学引用本文复制引用
李娟,汤德佑,傅娟..一种基于蚁群算法的生物序列并行比对方法[J].计算机工程与科学,2017,39(9):1610-1616,7.基金项目
国家自然科学基金(61201100) （61201100）
广州市科技计划(201508010029) （201508010029）
