Efficient string matching

Aho, Alfred V.; Corasick, Margaret J.

doi:10.1145/360825.360855

Cited by 2,309 publications

(1,128 citation statements)

References 8 publications

Supporting

Mentioning

1,119

Contrasting

Unclassified

Order By: Relevance

“…RELATED WORK Snort [9] and Bro [8], [3], [5], [10], [2] are two of the more popular public domain Network Intrusion Detection Systems (NIDSs). The current implementation of Snort uses the optimized version of the AC automaton [1]. Snort also uses SFK search and the Wu-Manber [13] multi-string search algorithm.…”

Section: Resultsmentioning

confidence: 99%

“…Aho-Corasick (AC) [1] is a multi-pattern matching algorithm, commonly employed in NIDS applications. There are two versions of it: a deterministic and a non-deterministic one.…”

Section: The Aho-corasick Algorithmmentioning

confidence: 99%

“…We choose to do so despite the fact that Zha and Sahni's [19] technique is 31% more spaceefficient and it requires 90% fewer popcount 1 success transition matches the current input. Assuming 32-bit pointers, this representation occupies 1032 bytes per node (including the MatchList pointer but not the size of the list itself).…”

Section: Tuck Et Al's Compressed Automatonmentioning

confidence: 99%

“…Arguably, the most popular way to perform this exact, multi-pattern string matching task is the Aho-Corasick [1] (AC) algorithm. However, AC, especially in its optimized form based on a Deterministic Finite Automaton (DFA), is not space-efficient.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Highly compressed multi-pattern string matching on the cell broadband engine

Zha

Scarpazza

Sahni

2011

2011 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

Abstract-With its 9 cores per chip, the IBM Cell/Broadband Engine (Cell) can deliver an impressive amount of compute power and benefit the string-matching kernels of network security, business analytics and natural language processing applications. However, the available amount of main memory on the system limits the maximum size of the dictionary supported by the string matching solution.To counter that, we propose a technique that employs compressed Aho-Corasick automata to perform fast, exact multipattern string matching with very large dictionaries. Our technique achieves the remarkable compression factors of 1:34 and 1:58, respectively, on the memory representation of Englishlanguage dictionaries and random binary string dictionaries. We demonstrate a parallel implementation for the Cell processor that delivers a sustained throughput between 0.90 and 2.35 Gbps per Cell blade, while supporting dictionary sizes up to 9.2 Million average patterns per Gbyte of main memory, and exhibiting resilience to content-based attacks.This high dictionary density enables natural language applications of an unprecedented scale to run on a single server blade.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Aho-Corasick (AC) [1] is a multi-pattern matching algorithm, commonly employed in NIDS applications. There are two versions of it: a deterministic and a non-deterministic one.…”

Section: The Aho-corasick Algorithmmentioning

confidence: 99%

Section: Tuck Et Al's Compressed Automatonmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Highly compressed multi-pattern string matching on the cell broadband engine

Zha

Scarpazza

Sahni

2011

2011 IEEE Symposium on Computers and Communications (ISCC)

View full text Add to dashboard Cite

show abstract

“…We construct the DFA M using the Aho-Corasick algorithm (Aho and Corasick, 1975), for which |Q| is proportional to the sum of the length of the strings. To obtain the DFAs for multiple matches, we concatenate several of the DFAs.…”

Section: Generalized Null Modelmentioning

confidence: 99%

Genome wide study of NF-Y type CCAAT boxes in unidirectional and bidirectional promoters in human and mouse

Häkkinen

Healy

Jacobs

et al. 2011

Journal of Theoretical Biology

View full text Add to dashboard Cite

International audienceA subset of CCAAT boxes are known binding sites for the transcription factor NF-Y. We characterize their number, mismatches to the consensus sequence, and locations in bidirectional and unidirectional promoter sequences in human and mouse. We confront the findings with an analytical null model of DNA sequences and find that NF-Y type CCAAT boxes play key, but distinct roles in the two types of promoters. They are found above chance in both, but in unidirectional only when having few mismatches. In bidirectional, the relative positions of multiple boxes differ from what is expected by chance, suggesting the need for contiguity. In agreement, when there are four boxes (four-box configurations), these have much lower number of mismatches than expected in bidirectional promoters alone. Positioning of the first box differs in the two types of promoters and the null model, and mismatches and positioning are found to be correlated. Finally, four-box configurations are conserved between human and mouse, supporting the relevance of the findings. We conclude that bidirectional and unidirectional promoters, while sharing some similarities, appear to possess distinct regulatory mechanisms at the sequence level

show abstract

An n-gram hash and skip algorithm for finding large numbers of keywords in continuous text streams

Cohen

1998

Softw: Pract. Exper.

View full text Add to dashboard Cite

SUMMARYA method of full-text scanning for matches in a large dictionary of keywords is described, suitable for Selective Dissemination of Information (SDI). The method is applicable to large dictionaries (say 10 4 to 10 5 entries), and to arbitrary byte streams for both patterns and data samples. The approach involves a sequence of tests, beginning with Boyer-Moore-Horspool skipping on digrams, followed by a succession of hash tests, and completed by trie searching, the combination of which is quite fast. Background information is provided, the algorithm and its implementation are described in detail, and experimental results are presented. In particular, tests suggest that the proposed method outperforms the algorithms of Aho-Corasick and Commentz-Walter when implementing large dictionaries.

show abstract

Efficient string matching

Cited by 2,309 publications

References 8 publications

Highly compressed multi-pattern string matching on the cell broadband engine

Highly compressed multi-pattern string matching on the cell broadband engine

Genome wide study of NF-Y type CCAAT boxes in unidirectional and bidirectional promoters in human and mouse

An n-gram hash and skip algorithm for finding large numbers of keywords in continuous text streams

Contact Info

Product

Resources

About