Construction of Aho Corasick automaton in linear time for integer alphabets
From MaRDI portal
Publication:844159
DOI10.1016/J.IPL.2005.11.019zbMATH Open1178.68310OpenAlexW1991673591MaRDI QIDQ844159FDOQ844159
Authors: Shiri Dori, Gad M. Landau 
Publication date: 18 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.019
Recommendations
- Combinatorial Pattern Matching
- An efficient linear pseudo-minimization algorithm for Aho-Corasick automata
- scientific article; zbMATH DE number 1538036
- scientific article; zbMATH DE number 3982522
- Constructions for alternating finite automata∗
- EFFICIENT AUTOMATA CONSTRUCTIONS AND APPROXIMATE AUTOMATA
- Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns
- Minimisation of acyclic deterministic automata in linear time
- scientific article; zbMATH DE number 1941938
Cites Work
- Efficient string matching
- Algorithms on Strings, Trees and Sequences
- Three Partition Refinement Algorithms
- Suffix Arrays: A New Method for On-Line String Searches
- A Space-Economical Suffix Tree Construction Algorithm
- Fast Pattern Matching in Strings
- On-line construction of suffix trees
- Title not available (Why is that?)
- Space efficient linear time construction of suffix arrays
- Title not available (Why is that?)
- Linear-time construction of suffix arrays (extended abstract)
- Replacing suffix trees with enhanced suffix arrays
- String Processing and Information Retrieval
Cited In (12)
- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics
- Searching and indexing circular patterns
- Fast and simple computations using prefix tables under Hamming and edit distance
- Accurate and efficient methods to improve multiple circular sequence alignment
- On suffix extensions in suffix trees
- An efficient linear pseudo-minimization algorithm for Aho-Corasick automata
- A Table Compression Method for Extended Aho-Corasick Automaton
- Reverse-safe text indexing
- Fast circular dictionary-matching algorithm
- Combinatorial Pattern Matching
- All-pairs suffix/prefix in optimal time using Aho-Corasick space
- Universal compressed text indexing
This page was built for publication: Construction of Aho Corasick automaton in linear time for integer alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844159)
