Abstract: Multiple string pattern matching is one of the most important fundamental in solving string processing. This principle simultaneously searches for all patterns appeared in a large given text. A new algorithm to this problem called “IVL-MSPM” is presented. The new solution adapted the “inverted lists”(shown in [39]) for accommodating the collection of patterns. The experimental results showed that the proposed data structures were constructed faster and more economic on space than the well known data structures: Trie, Reverted-Trie, and Suffix tree. The searching results were faster than the traditional algorithms especially small number of patterns and small text sizes.
Keyword: Multiple Pattern String Matching, String Patterns Matching, Inverted Lists, String Processing, Static Dictionary Matching
Title: New Inverted Lists-Multiple String Patterns Matching Algorithm
Author: Chouvalit Khancome, Veera Boonjing
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print), ISSN 2348-120X (online)
Research Publish Journals
