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 条
  • [21] Implementation and analysis of Smith-Waterman algorithm on systolic array
    Wang, Dong
    Tang, Zhi-Min
    [J]. Jisuanji Xuebao/Chinese Journal of Computers, 2004, 27 (01): : 12 - 20
  • [22] Implementation of CUDA GPU-Based Parallel Computing on Smith-Waterman Algorithm to Sequence Database Searches
    Bustamam, Alhadi
    Ardaneswari, Gianinna
    Lestari, Dian
    [J]. 2013 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER SCIENCE AND INFORMATION SYSTEMS (ICACSIS), 2013, : 137 - 142
  • [23] Parallel Tiled Codes Implementing the Smith-Waterman Alignment Algorithm for Two and Three Sequences
    Palkowski, Marek
    Bielecki, Wlodzimierz
    [J]. JOURNAL OF COMPUTATIONAL BIOLOGY, 2018, 25 (10) : 1106 - 1119
  • [24] Development of DNA sequencing accelerator based on Smith Waterman algorithm with heuristic divide and conquer technique for FPGA implementation
    Al Junid, Syed Abdul Mutalib
    Majid, Zulkifli Abd
    Halim, Abdul Karimi
    [J]. 2008 INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATION ENGINEERING, VOLS 1-3, 2008, : 994 - 996
  • [25] Accelerating the Smith-Waterman Algorithm Using Bitwise Parallel Bulk Computation Technique on GPU
    Nishimura, Takahiro
    Bordim, Jacir L.
    Ito, Yasuaki
    Nakano, Koji
    [J]. 2017 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW), 2017, : 932 - 941
  • [26] GPU accelerated Smith-Waterman
    Liu, Yang
    Huang, Wayne
    Johnson, John
    Vaidya, Sheila
    [J]. COMPUTATIONAL SCIENCE - ICCS 2006, PT 4, PROCEEDINGS, 2006, 3994 : 188 - 195
  • [27] Accelerating the Smith-Waterman Algorithm Using the Bitwise Parallel Bulk Computation Technique on the GPU
    Nishimura, Takahiro
    Bordim, Jacir Luiz
    Ito, Yasuaki
    Nakano, Koji
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2019, E102D (12): : 2400 - 2408
  • [28] Optimization Strategies for Smith-Waterman Algorithm on FPGA Platform
    Chang, Xin
    Escobar, Fernando A.
    Valderrama, Carlos
    Robert, Vincent
    [J]. 2014 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI), VOL 1, 2014, : 9 - 14
  • [29] A Smith-Waterman Systolic cell
    Yu, CW
    Kwong, KH
    Lee, KH
    Leong, PHW
    [J]. FIELD-PROGRAMMABLE LOGIC AND APPLICATIONS, PROCEEDINGS, 2003, 2778 : 375 - 384
  • [30] BLAZE (TM) - AN IMPLEMENTATION OF THE SMITH-WATERMAN SEQUENCE COMPARISON ALGORITHM ON A MASSIVELY-PARALLEL COMPUTER
    BRUTLAG, DL
    DAUTRICOURT, JP
    DIAZ, R
    FIER, J
    MOXON, B
    STAMM, R
    [J]. COMPUTERS & CHEMISTRY, 1993, 17 (02): : 203 - 207
12345