一种基于MPI的DNA序列匹配并行算法
Parallel Algorithm for DNA Sequences Alignment Based on MPI
NA序列蕴藏着各生物物种的基本信息，而研究DNA序列之间的相似性是生物学研究中的基本问题之一。目前，针对序列相似性匹配的算法有很多，有一部分是针对模糊匹配的，另一部分是针对精确匹配的，后者在生物学研究中亦扮演着重要的角色。在本文中，提出了一个基于MPI将FED算法并行化的新算法，它是针对精确匹配的研究。实验结果表明，相较于FED算法，这个新提出的算法不仅可以给出匹配的位置，还能在减小序列存储量的同时，大大提高算法的运行速度。
NA sequences have the fundamental information for each species and a comparison between DNA sequences is one of the basic biological problems. There are a large number of algorithms applied in sequence alignment. Some are for approximate alignment, and others are for exact alignment, which also plays an important role in biology research. In this paper, a new parallel algorithm based on FED algorithm for exact sequences alignment with MPI is proposed. The experimental results indicate that the proposed algorithm can report the matched positions in the specific sequence and improve the matching speed with MPI, as well as reduce the storage requirement.
戴东波、张武、束俊辉、薛倩斐、武星、张惠然、谢江
生物科学研究方法、生物科学研究技术计算技术、计算机技术分子生物学
NA编码NA序列序列匹配并行算法MPI
encoded DNA sequencessequences alignmentparallel algorithmsMPI
戴东波,张武,束俊辉,薛倩斐,武星,张惠然,谢江.一种基于MPI的DNA序列匹配并行算法[EB/OL].(2014-03-31)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/201403-824.点此复制
评论