Skip to search formSkip to main contentSkip to account menu

Aho–Corasick algorithm

Known as: Aho-Corasick algorithm, Margaret J. Corasick, Aho–Corasick string matching algorithm 
In computer science, the Aho–Corasick algorithm is a string searching algorithm invented by Alfred V. Aho and Margaret J. Corasick. It is a kind of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this research, a file undelete method is proposed by which the file recovery system retrieved the file metadata through a… 
2014
2014
Pattern discovery is one of the fundamental tasks in bioinformatics and pattern recognition is a powerful technique for searching… 
2013
2013
Pattern matching is an important operation in various applications such as computer and network security, bioinformatics, image… 
2013
2013
Conventionally, dictionary-based string pattern matching (SPM) has been implemented as Aho-Corasick deterministic finite… 
2012
2012
String matching requires a combination of (sometimes all) the following characteristics: high and/or predictable performance… 
2012
2012
A hardware string matching architecture is usually used to accelerate string matching in various applications that need to lter… 
2008
2008
Let a seed , S , be a string from the alphabet {1,*}, of arbitrary length k , which starts and ends with a 1. For example, S = 11… 
2007
2007
The Aho-Corasick (AC) algorithm is a very flexible and efficient but memory-hungry pattern matching algorithm that can scan the… 
2007
2007
Because of its accuracy, signature matching is considered an important technique in anti-virus/worm applications. Among some…