A parallel Smith-Waterman algorithm based on divide and conquer

被引：0
|
作者：
Zhang, F [1 ]
Qiao, XZ [1 ]
Liu, ZY [1 ]
机构：
[1] Chinese Acad Sci, Comp Technol Inst, Beijing 100080, Peoples R China
来源：
FIFTH INTERNATIONAL CONFERENCE ON ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PROCEEDINGS | 2002年
关键词：
biological sequence alignment; dynamic programming; divide and conquer; parallel;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Biological sequence comparison is an important tool for researchers in molecular biology. There are several algorithms for sequence comparison. The Smith-Waterman algorithm, based on dynamic programming, is one of the most fundamental algorithms in bioinformatics. However the existing parallel Smith-Waterman algorithm needs large memory space. As the data of biological sequences expand rapidly, the memory requirement of the existing parallel Smith-Waterman algorithm has becoming a critical problem. For resolving this problem, we develop a new parallel Smith-Waterman algorithm using the method of divide and conquer, named PSW-DC Memory space required in the new parallel algorithm is reduced significantly in comparison with existing ones. A key technique, named The C&E method, is developed for the implementation of the new parallel Smith-Waterman algorithm.
引用
收藏
页码：162 / 169
页数：8
相关论文
共 50 条
  • [1] Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
    ZHANG Fa1
    2. National Natural Science Foundation of China
    [J]. Science China(Information Sciences), 2004, (02) : 221 - 231
  • [2] Parallel divide and conquer bio-sequence comparison based on Smith-Waterman algorithm
    Zhang, F
    Qiao, XZ
    Liu, ZY
    [J]. SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2004, 47 (02): : 221 - 231
  • [3] Parallel divide and conquer bio-sequence comparison based on smith-waterman algorithm
    Fa Zhang
    Xiangzhen Qiao
    Zhiyong Liu
    [J]. Science in China Series F: Information Sciences, 2004, 47 : 221 - 231
  • [4] A Review of Parallel Implementations for the Smith-Waterman Algorithm
    Xia, Zeyu
    Cui, Yingbo
    Zhang, Ang
    Tang, Tao
    Peng, Lin
    Huang, Chun
    Yang, Canqun
    Liao, Xiangke
    [J]. INTERDISCIPLINARY SCIENCES-COMPUTATIONAL LIFE SCIENCES, 2022, 14 (01) : 1 - 14
  • [5] A parallel implementation of the Smith-Waterman algorithm for massive sequences searching
    Liao, HY
    Yin, ML
    Cheng, Y
    [J]. PROCEEDINGS OF THE 26TH ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY, VOLS 1-7, 2004, 26 : 2817 - 2820
  • [6] A New Parallel Method of Smith-Waterman Algorithm on a Heterogeneous Platform
    Chen, Bo
    Xu, Yun
    Yang, Jiaoyun
    Jiang, Haitao
    [J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT 1, PROCEEDINGS, 2010, 6081 : 79 - 90
  • [7] An improved smith-waterman algorithm based on spark parallelization
    Liu, Yanfeng
    Li, Leixiao
    Gao, Jing
    [J]. International Journal Bioautomation, 2019, 23 (01) : 117 - 129
  • [8] Parallel Smith-Waterman algorithm for local DNA comparison in a cluster of workstations
    Boukerche, A
    de Melo, ACMA
    Ayala-Rincon, M
    Santana, TM
    [J]. EXPERIMENTAL AND EFFICIENT ALGORITHMS, PROCEEDINGS, 2005, 3503 : 464 - 475
  • [9] A reconfigurable accelerator for Smith-Waterman algorithm
    Jiang, Xianyang
    Liu, Xinchun
    Xu, Lin
    Zhang, Peiheng
    Sun, Ninghui
    [J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2007, 54 (12) : 1077 - 1081
  • [10] Efficient Distributed Smith-Waterman Algorithm Based on Apache Spark
    Xu, Bo
    Li, Changlong
    Zhuang, Hang
    Wang, Jiali
    Wang, Qingfeng
    Zhou, Xuehai
    [J]. 2017 IEEE 10TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD), 2017, : 608 - 615
12345