Serial and parallel implementation of Needleman-Wunsch algorithm
Needleman-Wunsch dynamic programming algorithm measures the similarity of the pairwise sequence and finds the optimal pair given the number of sequences. The task becomes nontrivial as the number of sequences to compare or the length of sequences increases. This research aims to parallelize the comp...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | text |
| 出版: |
Animo Repository
2020
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/2279 https://animorepository.dlsu.edu.ph/context/faculty_research/article/3278/type/native/viewcontent |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | De La Salle University |