Efficient Three-Way Needleman-Wunsch Algorithm by Diagonal Computations on GPU
碩士 === 長庚大學 === 資訊工程學系 === 98 === Three-way alignment can be solved sequentially in O(mnl) time complexity and O(mn) space complexity, where m, n and l are the lengths of the sequences to be aligned. The complexities of three-way alignment limit its applicability CUDA (an acronym for Compute Un...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/10867372806426828009 |