Loading...
Please wait, while we are loading the content...
Similar Documents
Research on Pairwise Sequence Alignment Needleman-Wunsch Algorithm
| Content Provider | Semantic Scholar |
|---|---|
| Author | Jiang, Xiantao Fu, Xueliang Dong, Gaifang Li, Honghui |
| Copyright Year | 2017 |
| 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. |
| File Format | PDF HTM / HTML |
| DOI | 10.2991/icmmcce-17.2017.187 |
| Alternate Webpage(s) | https://download.atlantis-press.com/article/25882567.pdf |
| Alternate Webpage(s) | https://doi.org/10.2991/icmmcce-17.2017.187 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Notice |
