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ženo v:

Podrobná bibliografie
Vydáno v:	Proceedings - International Conference on Parallel and Distributed Systems s. 570 - 575
Hlavní autoři:	Lin, Cheng-Hung, Huang, Chun-Cheng
Médium:	Konferenční příspěvek Journal Article
Jazyk:	angličtina
Vydáno:	IEEE 01.12.2015
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!