Using CUDA GPU to Accelerate the Longest Common Subsequence Algorithm
碩士 === 國立彰化師範大學 === 資訊工程學系 === 102 === This thesis is to study how to use the emerging graphics processing units (GPU) to improve the longest common subsequence (LCS) problem, which widely used in the field of bioinformatics. To parallelize the LCS problem, the diagonal method suffers the problem th...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/22741243027393456051 |