KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Settings

Subject: search.filters.subject.Static Dictionary Matching

Search Results

Now showing 1 - 2 of 2
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Item,
    A two-hashing table multiple string pattern matching algorithm
    (2013-11-04)
    Khancome, Chouvalit
    ;
    Boonjing, Veera
    ;
    Chanvarasuth, Pisit
    Multiple string pattern matching is one of many approaches to simultaneously search occurrences of a large number of patterns in a given text. In this paper, a new solution to this problem is presented by using two-hashing tables to minimize attempting times. This solution, called Two-Hashing Table Multiple String Patterns Matching Algorithm (Two-HT-MSPMA), is suitable for very long length of minimum pattern length. Its time complexity is more efficient than classic algorithms. Empirical results showed that its attempting times were less than of traditional algorithms. © 2013 IEEE.
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Item type:Item,
    New hashing-based multiple string pattern matching algorithms
    (2012-07-23)
    Khancome, Chouvalit
    ;
    Boonjing, Veera
    The paper presents three new algorithms for multiple string pattern matching using hashing tables: a suffix search (SS), a suffix-prefix search (SPS), and a suffix-middle-prefix search (SMPS). It takes O(|P|) time and space preprocessing where |P| is the sum of all pattern lengths. They search for a fixed-length pattern m in a text with length |t| takes O(|t| |P|) in the worst case, O(|t|) in an average case, and O(|t|/m) in the best case. Furthermore, their attempting times are less than of traditional algorithms. © 2012 IEEE.