High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs
碩士 === 國立臺灣師範大學 === 電機工程學系 === 105 === Approximate string matching has been widely used in many applications, including deoxyribonucleic acid sequence searching, spell checking, text mining, and spam filters. The method is designed to find all locations of strings that approximately match a pattern...
Main Authors: | Huang, Chun-cheng, 黃俊程 |
---|---|
Other Authors: | Lin, Cheng-Hung |
Format: | Others |
Language: | zh-TW |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/5b596z |
Similar Items
-
A High Performance Parallel Algorithm for Approximate String Matching on Multi-core Processor
by: Lin, Sheng-Yuan, et al.
Published: (2013) -
Acceleration of Bit Parallel Algorithms for Approximate String Matching Using GPU
by: 王冠鈜 -
Accelerating Pattern Matching Using Two-Phase Parallel Algorithm on GPUs
by: Sie, Min-Chi, et al.
Published: (2017) -
Efficient Exact and Approximate String Matching Algorithms
by: Lu, Chia Wei, et al.
Published: (2014) -
Parallel approximate string matching applied to occluded object recognition
by: Smith, David
Published: (1987)