Enhanced Pattern Matching Performance Using Improved Boyer Moore Horspool Algorithm

Autor:	Dai Hong
Rok vydání:	2012
Předmět:	Software Theoretical computer science Matching (graph theory) business.industry Computer science Boyer–Moore–Horspool algorithm Computer Networks and Communications Hardware and Architecture Finite state Pattern matching business Algorithm Substring
Zdroj:	Journal of Convergence Information Technology. 7:70-76
ISSN:	2233-9299 1975-9320
DOI:	10.4156/jcit.vol7.issue4.9
Popis:	In computer science, the Boyer–Moore–Horspool algorithm is an algorithm for finding substrings in strings. A pattern matching problem can be classified into software and hardware based on implemental methods. It is important of enhance pattern matching performance. This paper proposes enhanced pattern matching performance using improved Boyer Moore Horspool Algorithm. It combines the deterministic finite state; the improved Boyer Moore Horspool Algorithm takes full use of the matching information to skip several characters. Experimental result shows that the proposed improved Boyer Moore Horspool Algorithm is effective.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5b98965e924fc690595eafe106681c9a https://doi.org/10.4156/jcit.vol7.issue4.9 Zobrazit plný text záznamu