@inproceedings{3b6292b49d8647709bcc8a62c0e9ac74,
title = "A parallel Smith-Waterman algorithm based on divide and conquer",
abstract = "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 implementation of the new parallel Smith-Waterman algorithm.",
keywords = "biological sequence alignment, divide and conquer, dynamic programming, parallel",
author = "Fa Zhang and Qiao, {Xiang Zhen} and Liu, {Zhi Yong}",
note = "Publisher Copyright: {\textcopyright} 2002 IEEE.; 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002 ; Conference date: 23-10-2002 Through 25-10-2002",
year = "2002",
doi = "10.1109/ICAPP.2002.1173568",
language = "English",
series = "Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "162--169",
editor = "Wanlei Zhou and Andrzej Goscinski and Guo-jie Li and Xue-bin Chi",
booktitle = "Proceedings - 5th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2002",
address = "United States",
}