High-Performance Parallel Location-Aware Algorithms for Approximate String Matching on GPUs

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 in accordance with the number of insert...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings - International Conference on Parallel and Distributed Systems pp. 570 - 575
Main Authors:	Lin, Cheng-Hung, Huang, Chun-Cheng
Format:	Conference Proceeding Journal Article
Language:	English
Published:	IEEE 01.12.2015
Subjects:	Acceleration Algorithm design and analysis Algorithms Approximate string matching Approximation algorithms bit-parallel algorithm Business process re-engineering Computer networks Data mining Digital signal processing graphic processing units Insertion Levenshtein distance nondeterministic finite automaton parallel algorithm Parallel processing Pattern matching Position (location) Registers Searching
ISSN:	1521-9097
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!