Research on Pairwise Sequence Alignment Needleman-Wunsch Algorithm
Authors
Xiantao Jiang, Xueliang Fu, Gaifang Dong, Honghui Li
Corresponding Author
Xiantao Jiang
Available Online September 2017.
- DOI
- 10.2991/icmmcce-17.2017.187How to use a DOI?
- Keywords
- Bioinformatics;Pairwise sequence alignment; Needleman-Wunsch algorithm; Dynamic programming
- Abstract
The pairwise sequence alignment algorithm, Needleman-Wunsch is one of the most basic algorithms in biological information processing. However, the Needleman-Wunsch algorithm based on dynamic programming gets optimal alignment results with high time complexity and space complexity,which is impractical.This paper proposes an improved algorithm of Needleman-Wunsch, and demonstrates the algorithm by experiment. With the same score and accuracy, we compare and analyze the running time before and after improvement. The experimental results show that the improved algorithm can reduce the time complexity of Needleman-Wunsch algorithm.
- Copyright
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Xiantao Jiang AU - Xueliang Fu AU - Gaifang Dong AU - Honghui Li PY - 2017/09 DA - 2017/09 TI - Research on Pairwise Sequence Alignment Needleman-Wunsch Algorithm BT - Proceedings of the 2017 5th International Conference on Mechatronics, Materials, Chemistry and Computer Engineering (ICMMCCE 2017) PB - Atlantis Press SP - 1041 EP - 1046 SN - 2352-5401 UR - https://doi.org/10.2991/icmmcce-17.2017.187 DO - 10.2991/icmmcce-17.2017.187 ID - Jiang2017/09 ER -