| Smith-Waterman算法OpenMP并行化 |
| |
| 引用本文： | 张瑜,王继东. Smith-Waterman算法OpenMP并行化[J]. 自动化技术与应用, 2010, 29(1): 37-40 |
| |
| 作者姓名： | 张瑜 王继东 |
| |
| 作者单位： | 西北师范大学,计算机科学与技术系,甘肃,兰州,730070;西北师范大学,计算机科学与技术系,甘肃,兰州,730070 |
| |
| 摘 要： | 基因比对可以实现对诲量生物信息的分析和处理,其中Smith—Waterman算法实现的比对信息精确度较高,但是处理速度慢。本文利用共享存储编程的工业标准OpenMPX;ySmith-Waterman算法进行了并行化实现。在一个拥有四个双核CPU的SMP节点上的测试表明,共享并行化使得该局部比对算法的速度提高了40％。
|
| 关 键 词： | OpenMP Smith-Waterman算法 并行编程 |
Openmp Parallelization of Smith-Waterman Algorithm |
| |
| ZHANG Yu,WANG Ji-dong. Openmp Parallelization of Smith-Waterman Algorithm[J]. Techniques of Automation and Applications, 2010, 29(1): 37-40 |
| |
| Authors: | ZHANG Yu WANG Ji-dong |
| |
| Affiliation: | ZHANG Yu,WANG Ji-dong(Deparment of Computer Science , Technology,Northwest Normal University,Lanzhou 730070 China) |
| |
| Abstract: | The pair-wise biological sequence alignment can process and analyses a large number of bioinformatics.The Smith-Waterman algorithm,which is one of the most widely used algorithms,has high precision in comparison,yet its speed is slower than others.In this paper,the OpenMP is used to parallelize Smith-Waterman algorithm,and the test on a SMP node with four CPUs(dual-core) shows that the speed is higher almost 40 percent compared with the original sequential program. |
| |
| Keywords: | OpenMP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
