Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,984,629 papers from all fields of science
Search
Sign In
Create Free Account
Aho–Corasick algorithm
Known as:
Aho-Corasick algorithm
, Margaret J. Corasick
, Aho–Corasick string matching algorithm
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Computational complexity theory
Computer science
Computer virus
Dictionary of Algorithms and Data Structures
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Heterogeneous Parallelization of Aho-Corasick Algorithm
S. Soroushnia
,
M. Daneshtalab
,
J. Plosila
,
P. Liljeberg
Practical Applications of Computational Biology…
2014
Corpus ID: 36377360
Pattern discovery is one of the fundamental tasks in bioinformatics and pattern recognition is a powerful technique for searching…
Expand
2013
2013
High Throughput Parallel Implementation of Aho-Corasick Algorithm on a GPU
Nhat-Phuong Tran
,
Myungho Lee
,
Sugwon Hong
,
Jaeyoung Choi
IEEE International Symposium on Parallel…
2013
Corpus ID: 2456623
Pattern matching is an important operation in various applications such as computer and network security, bioinformatics, image…
Expand
2012
2012
Aho-Corasick String Matching on Shared and Distributed-Memory Parallel Architectures
Antonino Tumeo
,
Oreste Villa
,
D. Chavarría-Miranda
IEEE Transactions on Parallel and Distributed…
2012
Corpus ID: 5751501
String matching requires a combination of (sometimes all) the following characteristics: high and/or predictable performance…
Expand
2011
2011
Highly compressed multi-pattern string matching on the cell broadband engine
Xinyan Zha
,
D. Scarpazza
,
S. Sahni
International Symposium on Computers and…
2011
Corpus ID: 14322621
With its 9 cores per chip, the IBM Cell/Broadband Engine (Cell) can deliver an impressive amount of compute power and benefit the…
Expand
2008
2008
Exact Distribution of a Spaced Seed Statistic for DNA Homology Detection
Gary Benson
,
Denise Y. F. Mak
SPIRE
2008
Corpus ID: 17533954
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…
Expand
2007
2007
A Memory-Efficient Reconfigurable Aho-Corasick FSM Implementation for Intrusion Detection Systems
Vassilis Dimopoulos
,
I. Papaefstathiou
,
D. Pnevmatikatos
International Conference on Embedded Computer…
2007
Corpus ID: 9194638
The Aho-Corasick (AC) algorithm is a very flexible and efficient but memory-hungry pattern matching algorithm that can scan the…
Expand
2007
2007
Generalized Aho-Corasick Algorithm for Signature Based Anti-Virus Applications
Tsern-Huei Lee
International Conference on Computer…
2007
Corpus ID: 1417822
Because of its accuracy, signature matching is considered an important technique in anti-virus/worm applications. Among some…
Expand
2002
2002
Processing Text Files as Is: Pattern Matching over Compressed Texts, Multi-byte Character Texts, and Semi-structured Texts
Masayuki Takeda
,
Satoru Miyamoto
,
+4 authors
S. Arikawa
SPIRE
2002
Corpus ID: 3163088
Techniques in processing text files "as is" are presented, in which given text files are processed without modification. The…
Expand
Highly Cited
1995
Highly Cited
1995
Matching a Set of Strings with Variable Length don't Cares
G. Kucherov
,
M. Rusinowitch
Theoretical Computer Science
1995
Corpus ID: 3048836
1994
1994
A Boyer-Moore type algorithm for regular expression pattern matching
B. Watson
,
Richard E. Watson
1994
Corpus ID: 29192590
,
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE