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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings - International Conference on Parallel and Distributed Systems s. 570 - 575
Hlavní autori:	Lin, Cheng-Hung, Huang, Chun-Cheng
Médium:	Konferenčný príspevok.. Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2015
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!