CSpace  > 中国科学院计算技术研究所期刊论文  > 英文
Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
Zhang, F; Qiao, XZ; Liu, ZY
2004-04-01
发表期刊SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES
ISSN1009-2757
卷号47期号:2页码:221-231
摘要Tools for pair-wise bio-sequence alignment have for long played a central role in computation biology. Several algorithms for bio-sequence alignment have been developed. The Smith-Waterman algorithm, based on dynamic programming, is considered the most fundamental alignment algorithm in bioinformatics. However the existing parallel Smith-Waterman algorithm needs large memory space, and this disadvantage limits the size of a sequence to be handled. As the data of biological sequences expand rapidly, the memory requirement of the existing parallel SmithWaterman algorithm has become a critical problem. For solving this problem, we develop a new parallel bio-sequence alignment algorithm, using the strategy of divide and conquer, named PSW-DC algorithm. In our algorithm, first, we partition the query sequence into several subsequences and distribute them to every processor respectively, then compare each subsequence with the whole subject sequence in parallel, using the Smith-Waterman algorithm, and get an interim result, finally obtain the optimal alignment between the query sequence and subject sequence, through the special combination and extension method. Memory space required in our algorithm is reduced significantly in comparison with existing ones. We also develop a key technique of combination and extension, named the C&E method, to manipulate the interim results and obtain the final sequences alignment. We implement the new parallel bio-sequences alignment algorithm, the PSW-DC, in a cluster parallel system.
关键词biological sequence alignment dynamic programming divide and conquer parallel
DOI10.1360/02yf0362
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Information Systems
WOS记录号WOS:000221118000007
出版者SCIENCE CHINA PRESS
引用统计
被引频次:3[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://119.78.100.204/handle/2XEOYT63/13839
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Zhang, F
作者单位1.Chinese Acad Sci, Comp Technol Inst, Beijing 100080, Peoples R China
2.Natl Nat Sci Fdn China, Beijing 100083, Peoples R China
推荐引用方式
GB/T 7714
Zhang, F,Qiao, XZ,Liu, ZY. Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm[J]. SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES,2004,47(2):221-231.
APA Zhang, F,Qiao, XZ,&Liu, ZY.(2004).Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm.SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES,47(2),221-231.
MLA Zhang, F,et al."Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm".SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES 47.2(2004):221-231.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhang, F]的文章
[Qiao, XZ]的文章
[Liu, ZY]的文章
百度学术
百度学术中相似的文章
[Zhang, F]的文章
[Qiao, XZ]的文章
[Liu, ZY]的文章
必应学术
必应学术中相似的文章
[Zhang, F]的文章
[Qiao, XZ]的文章
[Liu, ZY]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。