On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns

DOI10.1016/j.jda.2011.02.001zbMath1255.68092OpenAlexW2133888807MaRDI QIDQ414441

Emanuele Giaquinta, Domenico Cantone, Simone Faro

Publication date: 11 May 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2011.02.001

zbMATH Keywords

automatatext processingmultiple pattern matchingbit-parallelism

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algorithms on strings (68W32)

Uses Software

• FXT
• hfloat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New techniques for regular expression searching
• Average sizes of suffix trees and DAWGs
• Average complexity of exact and approximate multiple string matching
• A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM
• Efficient string matching
• Fast Pattern Matching in Strings
• Matters Computational
• Complete inverted files for efficient text retrieval and analysis
• Fast and flexible string matching by combining bit-parallelism and suffix automata

This page was built for publication: On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns