S. Kim and Y. Kim. A fast multiple string pattern matching algorithm. In Proceedings of 17th AoM/IAoM Conference on Computer Science, August 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Exclusion-based Signature Matching for Intrusion.. - Markatos, Antonatos.. (2002) (2 citations) (Correct)
....able to search for all strings concurrently. The automaton consumes the input one character at a time and keeps track of patterns that have (partially) matched the input. Algorithms based on Aho Corasick are widely used in current compiler technology, and several improvements have been presented [5, 9, 15]. Fisk and Varghese were the first to consider the design of NIDS specific string matching algorithms. They proposed an algorithm called Set wise Boyer MooreHorspool [6] adapting the Boyer Moore algorithm to simultaneously match a set of rules. This algorithm is shown to be faster than both ....
S. Kim and Y. Kim. A fast multiple string pattern matching algorithm. In Proceedings of 17th AoM/IAoM Conference on Computer Science, August 1999.
Fast Content-Based Packet Handling for Intrusion Detection - Fisk, Varghese (2001) (6 citations) (Correct)
....algorithm that combines the one pass approach of Aho Corasick with the skipping feature of Boyer Moore as optimized for the average case by Horspool. This sublinear multiple pattern algorithm is in the same class as those by Commentz Walter [7] Wu Manber [35] Gusfield [14] and Kim Kim [19], but to the best of our knowledge, after consulting the literature and algorithm experts, our setwise algorithm is a new algorithm and may be of independent interest. Third, we have implemented commonly used versions of BM, AC, and our new algorithm in a library that can easily be instantiated to ....
Sun Kim and Yanggon Kim, "A fast multiple string-pattern matching algorithm," Proceedings of the 17th AoM/IAoM Inernational Conference on Computer Science, May 1999.
A Probabilistic Approach to Sequence Assembly Validation - Kim, Liao, Tomb Self-citation (Kim) (Correct)
....distribution A fixed number of non overlapping patterns from each fragment are selected at random positions. Once all patterns are selected from all fragments, occurrences of the selected patterns are found in the entire shotgun data using a fast multiple string pattern matching algorithms[6]. A plot of the number of patterns in a fragment v.s the number of fragments is then generated. Figure 2 shows how to calculate the fragment distribution. Note that the fragment distribution is a fragment centric distribution that counts multiple pattern occurrences within a fragment. The ....
....approach to sequence assembly validation. Compared to a widely used fragment coverage method, our approach clearly identified misassembled regions. This approach is also computationally very efficient. Fragment distribution can be computed using an efficient multiple string matching algorithms[6]. Probability and entropy are easy to compute. While the current probability assignment is effective, it is ad hoc. We are currently developing a method to assign probability based on predicted coverage distribution and fragment distribution as discussed in Section 3.2, i.e, approximate coverage ....
Sun Kim and Yanggon Kim, "A Fast Multiple StringPattern Matching Algorithm," Proc. of 17th AoM/IAoM Conference on Computer Science, August 1999
Exclusion-based Signature Matching for Intrusion.. - Markatos, Antonatos.. (2002) (2 citations) (Correct)
No context found.
S. Kim and Y. Kim. A fast multiple string pattern matching algorithm. In Proceedings of 17th AoM/IAoM Conference on Computer Science, August 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC