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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings - International Conference on Parallel and Distributed Systems S. 570 - 575
Hauptverfasser:	Lin, Cheng-Hung, Huang, Chun-Cheng
Format:	Tagungsbericht Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.12.2015
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!